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

DOI10.1007/S12044-008-0036-2zbMATH Open1153.05020arXivmath/0701649OpenAlexW2134075432MaRDI QIDQ949467FDOQ949467

Authors: Sunder Sethuraman, K. B. Athreya, Arka P. Ghosh 

Publication date: 21 October 2008

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

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.

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

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

zbMATH Keywords

preferential attachmentscale-free graphspower-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)

Cites Work

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

Cited In (22)

• Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity
• On Bollobás‐Riordan random pairing model of preferential attachment graph
• Random networks with heterogeneous reciprocity
• Asymptotic fluctuations in supercritical Crump-Mode-Jagers processes
• Degree growth rates and index estimation in a directed preferential attachment model
• Consistency of Hill estimators in a linear preferential attachment model
• A phase transition for preferential attachment models with additive fitness
• From trees to graphs: collapsing continuous-time branching processes
• Nongrowing preferential attachment random graphs
• A scaling limit for the degree distribution in sublinear preferential attachment schemes
• Condensation phenomena in preferential attachment trees with neighbourhood influence
• Twitter event networks and the superstar model
• The dynamics of power laws: fitness and aging in preferential attachment trees
• Preferential attachment random graphs with general weight function
• A continuous-time N -interaction random graph model
• Random networks with preferential growth and vertex death
• Large deviations for the degree structure in preferential attachment schemes
• Supercritical percolation on large scale-free random trees
• Large degrees in scale-free inhomogeneous random graphs
• A continuous-time network evolution model describing 3-interactions
• Local weak convergence for PageRank
• Large deviations for the leaves in some random trees

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)