Scaling limits and influence of the seed graph in preferential attachment trees
From MaRDI portal
Publication:495132
DOI10.5802/jep.15zbMath1320.05110arXiv1406.1758OpenAlexW2950481285WikidataQ115255793 ScholiaQ115255793MaRDI QIDQ495132
Nicolas Curien, Ioan Manolescu, Igor Kortchemski, Thomas S. A. Duquesne
Publication date: 9 September 2015
Published in: Journal de l'École Polytechnique -- Mathématiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1758
Martingales with discrete parameter (60G42) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (20)
Correlated randomly growing graphs ⋮ Finding the seed of uniform attachment trees ⋮ Intrinsic area near the origin for self-similar growth-fragmentations and related random surfaces ⋮ Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Influence of the seed in affine preferential attachment trees ⋮ Infinite stable looptrees ⋮ Root estimation in Galton–Watson trees ⋮ Random gluing of metric spaces ⋮ Growing random graphs with a preferential attachment structure ⋮ Degree centrality and root finding in growing random networks ⋮ Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Tail asymptotics for extinction times of self-similar fragmentations ⋮ Finding Adam in random growing trees ⋮ Change point detection in network models: preferential attachment and long range dependence ⋮ Persistence of hubs in growing random networks ⋮ Brownian motion on stable looptrees ⋮ Joint degree distributions of preferential attachment random graphs ⋮ Liouville quantum gravity and the Brownian map II: geodesics and continuity of the embedding ⋮ Broadcasting on random recursive trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The stable trees are nested
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Percolation on random triangulations and stable looptrees
- The continuum random tree. I
- Random trees and applications
- Recursive self-similarity for random trees, random triangulations and Brownian excursion
- Random networks with sublinear preferential attachment: the giant component
- The continuum limit of critical random graphs
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Random stable looptrees
- The degree sequence of a scale-free random graph process
- THE BROWNIAN MAP: A UNIVERSAL LIMIT FOR RANDOM PLANAR MAPS
- Emergence of Scaling in Random Networks
- Tessellations of random maps of arbitrary genus
- On random trees
- The Maximum Degree of the Barabási–Albert Random Tree
- Random Walks on Infinite Graphs and Groups
This page was built for publication: Scaling limits and influence of the seed graph in preferential attachment trees