Geodesic
Random enriched trees with applications to random graphs
Benedikt Stufler1
1University of Zurich
The electronic journal of combinatorics, Tome 25 (2018) no. 3

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled $k$-trees that are rooted at a $k$-clique of distinguishable vertices. For both models we establish a Gromov–Hausdorff scaling limit, a Benjamini–Schramm limit, and a local weak limit that describes the asymptotic shape near the fixed root.
DOI : 10.37236/7328
Classification : 60C05, 05C80
Mots-clés : random graphs, symmetries, scaling limits, local weak limits

Benedikt Stufler  1

1 University of Zurich 
Benedikt Stufler. Random enriched trees with applications to random graphs. The electronic journal of combinatorics, Tome 25 (2018) no. 3. doi: 10.37236/7328
@article{10_37236_7328,
     author = {Benedikt Stufler},
     title = {Random enriched trees with applications to random graphs},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {3},
     doi = {10.37236/7328},
     zbl = {1393.60013},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7328/}
}
TY  - JOUR
AU  - Benedikt Stufler
TI  - Random enriched trees with applications to random graphs
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7328/
DO  - 10.37236/7328
ID  - 10_37236_7328
ER  - 
%0 Journal Article
%A Benedikt Stufler
%T Random enriched trees with applications to random graphs
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/7328/
%R 10.37236/7328
%F 10_37236_7328

Cité par Sources :