当前位置: X-MOL 学术Random Struct. Algorithms › 论文详情
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 graphs from a subset of connected k-trees.
Random Structures and Algorithms ( IF 1 ) Pub Date : 2018-09-11 , DOI: 10.1002/rsa.20802
Michael Drmota 1 , Emma Yu Jin 1 , Benedikt Stufler 2
Affiliation  

For any set Ω of non-negative integers such that { 0 , 1 } ⊊ Ω , we consider a random Ω-k-tree G n,k that is uniformly selected from all connected k-trees of (n + k) vertices such that the number of (k + 1)-cliques that contain any fixed k-clique belongs to Ω. We prove that Gn,k, scaled by ( k H k σ Ω ) / ( 2 n ) where H k is the kth harmonic number and σ Ω > 0, converges to the continuum random tree T e . Furthermore, we prove local convergence of the random Ω-k-tree G n , k ∘ to an infinite but locally finite random Ω-k-tree G∞,k.

中文翻译:

连接 k 树子集的随机图的图限制。

对于任何非负整数集合 Ω,使得 { 0 , 1 } ⊊ Ω ,我们考虑一个随机 Ω-k-树 G n,k ,它是从 (n + k) 个顶点的所有连接的 k 树中均匀选择的,例如包含任意固定 k 团的 (k + 1) 团的数量属于 Ω。我们证明 Gn,k 按 ( k H k σ Ω ) / ( 2 n ) 缩放,其中 H k 是第 k 次谐波数且 σ Ω > 0,收敛到连续随机树 Te 。此外,我们证明了随机 Ω-k-树 G n , k ∘ 到无限但局部有限的随机 Ω-k-树 G∞,k 的局部收敛。
更新日期:2019-11-01
down
wechat
bug