Joint degree distributions of preferential attachment random graphs
From MaRDI portal
(Redirected from Publication:5233172)
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.
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
Cites work
- A survey of random processes with reinforcement
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Brownian motion, bridge excursion, and meander characterized by sampling at independent uniform times
- Coexistence in preferential attachment networks
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Degree asymptotics with rates for preferential attachment random graphs
- Emergence of Scaling in Random Networks
- Generalized gamma approximation with rates for urns, walks and trees
- scientific article; zbMATH DE number 1531546 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Limit theorems for triangular urn schemes
- 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
- Random graphs and complex networks. Volume 1
- Random trees and general branching processes
- Scaling limits and influence of the seed graph in preferential attachment trees
- Stein's method for the beta distribution and the Pólya-Eggenberger urn
- The continuum random tree. I
- The continuum random tree. III
- 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
- The Structure and Function of Complex Networks
- Total variation error bounds for geometric approximation
Cited in
(32)- Pólya urns with immigration at random times
- Large deviations for the degree structure in preferential attachment schemes
- Degree asymptotics with rates for preferential attachment random graphs
- Geometry of weighted recursive and affine preferential attachment trees
- On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
- \( \gamma \)-variable first-order logic of preferential attachment random graphs
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Convergence properties of the degree distribution of some growing network models
- Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
- Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- Tauberian theory for multivariate regularly varying distributions with application to preferential attachment networks
- Gibbs partitions, Riemann-Liouville fractional operators, Mittag-Leffler functions, and fragmentations derived from stable subordinators
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
- Rate of convergence for traditional Pólya urns
- On the number of non-zero elements of joint degree vectors
- Fluctuations in a general preferential attachment model via Stein's method
- Dirichlet approximation of equilibrium distributions in Cannings models with mutation
- Asymptotic degree distribution in preferential attachment graph models with multiple type edges
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- On a memory game and preferential attachment graphs
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
- Degree centrality and root finding in growing random networks
- Asymptotic normality of degree counts in a general preferential attachment model
- Eve, Adam and the preferential attachment tree
- Multivariate regular variation of preferential attachment models
- The Zagreb index of several random models
- Local weak limit of preferential attachment random trees with additive fitness
- A preferential attachment model with random initial degrees
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)
