Joint degree distributions of preferential attachment random graphs
From MaRDI portal
Publication:5233172
DOI10.1017/apr.2017.5zbMath1425.60025arXiv1402.4686OpenAlexW2963133236MaRDI QIDQ5233172
Nathan Ross, Erol A. Peköz, Adrian Roellin
Publication date: 16 September 2019
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.4686
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Special processes (60K99) Combinatorial probability (60C05)
Related Items
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ Degree centrality and root finding in growing random networks ⋮ Pólya urns with immigration at random times ⋮ Rate of convergence for traditional Pólya urns ⋮ Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size ⋮ Geometry of weighted recursive and affine preferential attachment trees ⋮ Fluctuations in a general preferential attachment model via Stein's method ⋮ Dirichlet approximation of equilibrium distributions in Cannings models with mutation ⋮ Gibbs partitions, Riemann–Liouville fractional operators, Mittag–Leffler functions, and fragmentations derived from stable subordinators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling limits and influence of the seed graph in preferential attachment trees
- Generalized gamma approximation with rates for urns, walks and trees
- The continuum random tree. I
- Limit theorems for triangular urn schemes
- A survey of random processes with reinforcement
- Brownian motion, bridge excursion, and meander characterized by sampling at independent uniform times
- Degree asymptotics with rates for preferential attachment random graphs
- On a preferential attachment and generalized Pólya's urn model
- Total variation error bounds for geometric approximation
- The continuum random tree. III
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- The Maximum Degree of the Barabási–Albert Random Tree
- Coexistence in Preferential Attachment Networks
- Stein's Method for the Beta Distribution and the Pólya-Eggenberger Urn
- Random trees and general branching processes