Geometry of weighted recursive and affine preferential attachment trees

DOI10.1214/21-EJP640zbMath1468.05034arXiv1904.07115OpenAlexW3172085584MaRDI QIDQ2042867

Delphin Sénizergues

Publication date: 21 July 2021

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

limit theoremspreferential attachmentprofile of random treesweighted recursive trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05)

Related Items (9)

Condensation phenomena in preferential attachment trees with neighbourhood influence ⋮ Growing random graphs with a preferential attachment structure ⋮ Degree distributions in recursive trees with fitnesses ⋮ Stable graphs: distributions and line-breaking construction ⋮ Degree centrality and root finding in growing random networks ⋮ Decorated stable trees ⋮ Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights ⋮ Dynamical models for random simplicial complexes ⋮ Correction terms for the height of weighted recursive trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized gamma approximation with rates for urns, walks and trees
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• A preferential attachment model with random initial degrees
• Martingales and profile of binary search trees
• Limit theorems for triangular urn schemes
• Scaling limits of \(k\)-ary growing trees
• A time-dependent version of Pólya's urn
• A survey of random processes with reinforcement
• A functional limit theorem for the profile of \(b\)-ary trees
• A new family of Markov branching trees: the alpha-gamma model
• Branching processes in the analysis of the heights of trees
• Uniform convergence of martingales in the branching random walk
• General Edgeworth expansions with applications to profiles of random trees
• Pólya urns with immigration at random times
• Scaling limits for some random trees constructed inhomogeneously
• The profile of binary search trees
• Degree asymptotics with rates for preferential attachment random graphs
• A phase transition for preferential attachment models with additive fitness
• Asymptotic behavior and distributional limits of preferential attachment graphs
• A line-breaking construction of the stable trees
• Random Graphs and Complex Networks
• Emergence of Scaling in Random Networks
• Asymptotic results on Hoppe trees and their variations
• Width of a scale-free tree
• On the asymptotic behaviour of random recursive trees in random environments
• Random Trees
• Note on the heights of random recursive trees and random m‐ary search trees
• The Structure and Function of Complex Networks
• Random trees constructed by aggregation
• Random-Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs
• The Maximum Degree of the Barabási–Albert Random Tree
• Random walks with preferential relocations and fading memory: a study through random recursive trees
• Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
• Joint degree distributions of preferential attachment random graphs
• Inequalities for the $r$th Absolute Moment of a Sum of Random Variables, $1 \leqq r \leqq 2$
• Probability
• Growing random networks with fitness

This page was built for publication: Geometry of weighted recursive and affine preferential attachment trees