Near critical preferential attachment networks have small giant components

DOI10.1007/s10955-018-2054-5zbMath1404.05192arXiv1712.00400OpenAlexW3104406213MaRDI QIDQ1633965

Maren Eckhoff, Peter Mörters, Marcel Ortgiese

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

percolationsurvival probabilitypreferential attachmentBarabási-Albert modelscale-free networkkilled branching random walk

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Applications of branching processes (60J85) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics for the survival probability in a killed branching random walk
• Survival probability of the branching random walk killed below a linear boundary
• Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees
• Random networks with sublinear preferential attachment: degree evolutions
• Perturbation theory for linear operators.
• Random networks with sublinear preferential attachment: the giant component
• Small Deviations in a Space of Trajectories
• The phase transition in the uniformly grown random graph has infinite order
• Slow emergence of the giant component in the growing m‐out graph
• Lectures on the Poisson Process
• The Small Giant Component in Scale-Free Random Graphs

This page was built for publication: Near critical preferential attachment networks have small giant components