Growing random graphs with a preferential attachment structure

zbMath1482.05315arXiv2002.09999MaRDI QIDQ5026477

Delphin Sénizergues

Publication date: 8 February 2022

Full work available at URL: https://arxiv.org/abs/2002.09999

zbMATH Keywords

scaling limitline-breaking constructioncontinuum random treesRémy's algorithmpreferential attachment treeself-similar random metric spaceweighted recursive tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Fractals (28A80)

Related Items (3)

Stable graphs: distributions and line-breaking construction ⋮ A binary embedding of the stable line-breaking construction ⋮ Decorated stable trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• The stable trees are nested
• Scaling limits and influence of the seed graph in preferential attachment trees
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The continuum random tree. I
• Rayleigh processes, real trees, and root growth with re-grafting
• On the geometry of Urysohn's universal metric space
• Limit theorems for triangular urn schemes
• Scaling limits of \(k\)-ary growing trees
• Urysohn universal space, its development and Hausdorff's approach
• Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
• A new family of Markov branching trees: the alpha-gamma model
• Branching processes in Lévy processes: The exploration process
• Scaling limits for some random trees constructed inhomogeneously
• The genealogy of self-similar fragmentations with negative index as a continuum random tree
• Probabilistic and fractal aspects of Lévy trees
• Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
• Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
• Scaling limits of multi-type Markov branching trees
• Geometry of weighted recursive and affine preferential attachment trees
• Random gluing of metric spaces
• The vertex-cut-tree of Galton-Watson trees converging to a stable tree
• Random real trees
• Random stable looptrees
• A line-breaking construction of the stable trees
• Scaling Limits of Random Trees and Random Graphs
• The distribution of the maximum Brownian excursion
• On the exponential functional of Markov Additive Processes, and applications to multi-type self-similar fragmentation processes and trees
• Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• Extensions of Measures and the Von Neumann Selection Theorem

This page was built for publication: Growing random graphs with a preferential attachment structure