Joint degree distributions of preferential attachment random graphs
From MaRDI portal
Publication:5233172
DOI10.1017/APR.2017.5zbMATH Open1425.60025arXiv1402.4686OpenAlexW2963133236MaRDI QIDQ5233172FDOQ5233172
Authors: Erol A. Peköz, Nathan Ross, Adrian Röllin 
Publication date: 16 September 2019
Published in: Advances in Applied Probability (Search for Journal in Brave)
Abstract: We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p and also provide optimal rates of convergence of the finite dimensional distributions. The results hold for models with any general initial seed graph and any fixed number of initial outgoing edges per vertex; we generate non-tree graphs using both a lumping and a sequential rule. Convergence of the order statistics and optimal rates of convergence to the maximum of the degrees is also established.
Full work available at URL: https://arxiv.org/abs/1402.4686
Recommendations
- Degree asymptotics with rates for preferential attachment random graphs
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
- Asymptotic degree distribution in preferential attachment graph models with multiple type edges
- Preferential attachment random graphs with general weight function
Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Special processes (60K99)
Cites Work
- Title not available (Why is that?)
- Random graphs and complex networks. Volume 1
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- The degree sequence of a scale-free random graph process
- The Maximum Degree of the Barabási–Albert Random Tree
- The structure and dynamics of networks
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Stein's method for the beta distribution and the Pólya-Eggenberger urn
- A survey of random processes with reinforcement
- Degree asymptotics with rates for preferential attachment random graphs
- The continuum random tree. III
- Limit theorems for triangular urn schemes
- The continuum random tree. I
- Total variation error bounds for geometric approximation
- Generalized gamma approximation with rates for urns, walks and trees
- Title not available (Why is that?)
- Random trees and general branching processes
- Scaling limits and influence of the seed graph in preferential attachment trees
- Brownian motion, bridge excursion, and meander characterized by sampling at independent uniform times
- On a preferential attachment and generalized Pólya's urn model
- Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
- Coexistence in preferential attachment networks
Cited In (29)
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
- Convergence properties of the degree distribution of some growing network models
- Geometry of weighted recursive and affine preferential attachment trees
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
- A preferential attachment model with random initial degrees
- On a memory game and preferential attachment graphs
- \( \gamma \)-variable first-order logic of preferential attachment random graphs
- Degree centrality and root finding in growing random networks
- Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
- Asymptotic degree distribution in preferential attachment graph models with multiple type edges
- Gibbs partitions, Riemann-Liouville fractional operators, Mittag-Leffler functions, and fragmentations derived from stable subordinators
- Rate of convergence for traditional Pólya urns
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- Dirichlet approximation of equilibrium distributions in Cannings models with mutation
- Eve, Adam and the preferential attachment tree
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- On the number of non-zero elements of joint degree vectors
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Degree asymptotics with rates for preferential attachment random graphs
- Large deviations for the degree structure in preferential attachment schemes
- Fluctuations in a general preferential attachment model via Stein's method
- Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
- Tauberian theory for multivariate regularly varying distributions with application to preferential attachment networks
- Asymptotic normality of degree counts in a general preferential attachment model
- Pólya urns with immigration at random times
This page was built for publication: Joint degree distributions of preferential attachment random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233172)
