HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Graph limits of random graphs from a subset of connected k-trees

Abstract : For any set Ω of non-negative integers such that {0, 1} ⊆ Ω and {0, 1} = Ω, we consider a random Ω-k-tree G n,k that is uniformly selected from all connected k-trees of (n + k) vertices where the number of (k + 1)-cliques that contain any fixed k-clique belongs to Ω. We prove that G n,k , scaled by (kH k σ Ω)/(2 √ n) where H k is the k-th Harmonic number and σ Ω > 0, converges to the Continuum Random Tree Te. Furthermore, we prove the local convergence of the rooted random Ω-k-tree G • n,k to an infinite but locally finite random Ω-k-tree G ∞,k .
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [54 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01408160
Contributor : Benedikt Stufler Connect in order to contact the contributor
Submitted on : Saturday, December 3, 2016 - 11:37:20 AM
Last modification on : Wednesday, November 3, 2021 - 4:18:22 AM
Long-term archiving on: : Monday, March 20, 2017 - 9:27:46 PM

File

CRT-k-tree_v10.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-01408160, version 1
  • ARXIV : 1605.05191

Collections

Citation

Michael Drmota, Emma Yu, Benedikt Stufler. Graph limits of random graphs from a subset of connected k-trees. 2016. ⟨ensl-01408160⟩

Share

Metrics

Record views

180

Files downloads

84