From trees to graphs: collapsing continuous-time branching processes

DOI10.1017/jpr.2018.57zbMath1400.05210arXiv1711.03358OpenAlexW2963671383WikidataQ128937110 ScholiaQ128937110MaRDI QIDQ4555297

Remco van der Hofstad, Alessandro Garavaglia

Publication date: 19 November 2018

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

branching processpreferential attachmentageing

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Random graphs (graph-theoretic aspects) (05C80) Convergence of probability measures (60B10)

Related Items

Local weak convergence for PageRank, Degree centrality and root finding in growing random networks, Pagerank asymptotics on directed preferential attachment networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of the degree distribution of some growing network models
• A preferential attachment model with random initial degrees
• Growth of preferential attachment random graphs via continuous-time branching processes
• The dynamics of power laws: fitness and aging in preferential attachment trees
• The diameter of a scale-free random graph
• Asymptotic behavior and distributional limits of preferential attachment graphs
• The degree sequence of a scale-free random graph process
• Random Graphs and Complex Networks
• Statistical mechanics of complex networks
• The growth and composition of branching populations
• The degree sequences and spectra of scale-free random graphs
• On the convergence of supercritical general (C-M-J) branching processes
• On the covariance of the level sizes in random recursive trees
• Asymptotic degree distribution in random recursive trees
• Concentration of vertex degrees in a scale‐free random graph process
• Random trees and general branching processes
• Preferential Attachment Random Graphs with General Weight Function