Growth of preferential attachment random graphs via continuous-time branching processes
From MaRDI portal
Publication:949467
Abstract: A version of ``preferential attachment random graphs, corresponding to linear ``weights with random ``edge additions, which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time branching scheme and, using the branching process apparatus, several results on the graph model asymptotics are obtained, some extending previous results, such as growth rates for a typical degree and the maximal degree, behavior of the vertex where the maximal degree is attained, and a law of large numbers for the empirical distribution of degrees which shows certain ``scale-free or ``power-law behaviors.
A graph process \({G(n): n=0,1,\dots}\) starts with a graph \(G(0)\) consisting of a single edge between two vertices. The graph \(G(n+1)\) is obtained from \(G(n)\) by selecting one of the vertices in \(G(n)\) with a probability that is proportional to a linear function of its degree and joining that vertex to a new vertex by \(x(n+1)\) parallell edges. The variables \(x(1), x(2),\dots \) are independent random variables with a common probability distribution on the positive integers. The graph \(G(n)\) can also be described as a tree with random edge weights. Asymptotic results are given for the degrees, the maximum degree, and the degree distribution of \(G(n)\). In particular, the limiting degree distribution exhibits a power-law behavior.
Recommendations
- Random graphs associated to some discrete and continuous time preferential attachment models
- Preferential attachment random graphs with general weight function
- Growing random graphs with a preferential attachment structure
- Random trees and general branching processes
- Degree asymptotics with rates for preferential attachment random graphs
Cites work
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- A general model of web graphs
- A survey of random processes with reinforcement
- Complex graphs and networks
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 3816788 (Why is no real title available?)
- scientific article; zbMATH DE number 2119076 (Why is no real title available?)
- scientific article; zbMATH DE number 3272753 (Why is no real title available?)
- Measure Theory and Probability Theory
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- On random trees
- On the equivalence of conditions on a branching process in continuous time and on its offspring distribution
- Random trees and general branching processes
- Statistical mechanics of complex networks
- The degree sequence of a scale-free random graph process
- The Maximum Degree of the Barabási–Albert Random Tree
- The Structure and Function of Complex Networks
Cited in
(30)- The dynamics of power laws: fitness and aging in preferential attachment trees
- Large deviations for the degree structure in preferential attachment schemes
- Competing growth processes with random growth rates and random birth times
- A phase transition for preferential attachment models with additive fitness
- Large degrees in scale-free inhomogeneous random graphs
- Condensation phenomena in preferential attachment trees with neighbourhood influence
- Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity
- Local weak convergence for PageRank
- Supercritical percolation on large scale-free random trees
- Degree growth rates and index estimation in a directed preferential attachment model
- Consistency of Hill estimators in a linear preferential attachment model
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Random graphs associated to some discrete and continuous time preferential attachment models
- Nongrowing preferential attachment random graphs
- Random networks with preferential growth and vertex death
- Large deviations for the leaves in some random trees
- From trees to graphs: collapsing continuous-time branching processes
- A preferential attachment process approaching the Rado graph
- Growing random graphs with a preferential attachment structure
- Preferential attachment processes approaching the Rado multigraph
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- Preferential attachment random graphs with general weight function
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- A continuous-time network evolution model describing 3-interactions
- Random networks with heterogeneous reciprocity
- Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point
- Asymptotic fluctuations in supercritical Crump-Mode-Jagers processes
- A continuous-time N -interaction random graph model
- Degree counts in random simplicial complexes of the preferential attachment type
- Twitter event networks and the superstar model
This page was built for publication: Growth of preferential attachment random graphs via continuous-time branching processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949467)
