Robustness of scale-free spatial networks

DOI10.1214/16-AOP1098zbMath1367.05194arXiv1504.00618OpenAlexW2963048821MaRDI QIDQ2012248

Peter Mörters, Emmanuel Jacob

Publication date: 28 July 2017

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

robustnessclusteringphase transitioncontinuum percolationpreferential attachmentBarabási-Albert modelscale-free networkspatial networkgiant componentpower-lawgeometric random graphBK-inequalitydisjoint occurrence

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05) Structural characterization of families of graphs (05C75)

Related Items (13)

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions ⋮ Transience Versus Recurrence for Scale-Free Spatial Networks ⋮ Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Spatial Gibbs random graphs ⋮ Rumors Spread Slowly in a Small-World Spatial Network ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ Clustering and percolation on superpositions of Bernoulli random graphs ⋮ The contact process with dynamic edges on \(\mathbb{Z}\) ⋮ Distances and large deviations in the spatial preferential attachment model ⋮ The age-dependent random connection model ⋮ The effect of avoiding known infected neighbors on the persistence of a recurring infection process ⋮ Percolation phase transition in weight-dependent random connection models ⋮ Distance evolutions in growing preferential attachment graphs

This page was built for publication: Robustness of scale-free spatial networks