Growth of preferential attachment random graphs via continuous-time branching processes

DOI10.1007/s12044-008-0036-2zbMath1153.05020arXivmath/0701649OpenAlexW2134075432MaRDI QIDQ949467

Sunder Sethuraman, Krishna B. Athreya, Arka Prasanna Ghosh

Publication date: 21 October 2008

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

scale-free graphspreferential attachmentpower-law degree distributionRandom graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Vertex degrees (05C07)

Related Items (17)

Condensation phenomena in preferential attachment trees with neighbourhood influence ⋮ From trees to graphs: collapsing continuous-time branching processes ⋮ Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity ⋮ The dynamics of power laws: fitness and aging in preferential attachment trees ⋮ Local weak convergence for PageRank ⋮ Consistency of Hill estimators in a linear preferential attachment model ⋮ A continuous-time network evolution model describing 3-interactions ⋮ Random networks with heterogeneous reciprocity ⋮ Large deviations for the degree structure in preferential attachment schemes ⋮ Supercritical percolation on large scale-free random trees ⋮ A scaling limit for the degree distribution in sublinear preferential attachment schemes ⋮ Random Networks with Preferential Growth and Vertex Death ⋮ Degree growth rates and index estimation in a directed preferential attachment model ⋮ A phase transition for preferential attachment models with additive fitness ⋮ Twitter event networks and the superstar model ⋮ Large deviations for the leaves in some random trees ⋮ Large degrees in scale-free inhomogeneous random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of random processes with reinforcement
• On the equivalence of conditions on a branching process in continuous time and on its offspring distribution
• The degree sequence of a scale-free random graph process
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• The Structure and Function of Complex Networks
• On random trees
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• The Maximum Degree of the Barabási–Albert Random Tree
• A general model of web graphs
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• Random trees and general branching processes
• Measure Theory and Probability Theory

This page was built for publication: Growth of preferential attachment random graphs via continuous-time branching processes