当前位置: X-MOL 学术Comb. Probab. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Graph limits of random unlabelled k-trees
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2020-05-18 , DOI: 10.1017/s0963548320000164
Emma Yu Jin , Benedikt Stufler

We study random unlabelled k-trees by combining the colouring approach by Gainer-Dewar and Gessel (2014) with the cycle-pointing method by Bodirsky, Fusy, Kang and Vigerske (2011). Our main applications are Gromov–Hausdorff–Prokhorov and Benjamini–Schramm limits that describe their asymptotic geometric shape on a global and local scale as the number of (k + 1)-cliques tends to infinity.

中文翻译:

随机未标记 k 树的图限制

我们研究随机未标记ķ- 通过将 Gainer-Dewar 和 Gessel (2014) 的着色方法与 Bodirsky、Fusy、Kang 和 Vigerske (2011) 的循环指向方法相结合的树。我们的主要应用是 Gromov–Hausdorff–Prokhorov 和 Benjamini–Schramm 极限,它们将它们在全局和局部尺度上的渐近几何形状描述为 (ķ+ 1)-派系趋于无穷大。
更新日期:2020-05-18
down
wechat
bug