Penalising transmission to hubs in scale-free spatial random graphs
DOI10.1214/21-AIHP1149zbMath1483.05161arXiv2004.01149OpenAlexW3217130310MaRDI QIDQ2077353
John Lapinskas, Júlia Komjáthy, Johannes Lengler
Publication date: 25 February 2022
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.01149
hyperbolic random graphsinformation spreadSI epidemicexplosive first passage percolationgeometric inhomogeneous random graphsscale-free percolation
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Communication theory (94A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scale-free percolation
- On explosions in heavy-tailed branching random walks
- On the largest component of a hyperbolic model of complex networks
- Bootstrap percolation and the geometry of complex networks
- The growth of the infinite long-range percolation cluster
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
- Spectral gap of random hyperbolic graphs and related parameters
- Structures in supercritical scale-free percolation
- When is a scale-free graph ultra-small?
- Geometric inhomogeneous random graphs
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Weighted distances in scale-free configuration models
- On the scaling of the chemical distance in long-range percolation models
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Scale-free percolation in continuum space
- Complex networks: structure and dynamics
- Clustering and the Hyperbolic Geometry of Complex Networks
- Statistical mechanics of complex networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- Typical distances in a geometric model for complex networks
- Continuum Percolation
- Networks
- Rumors Spread Slowly in a Small-World Spatial Network
- Bootstrap percolation on geometric inhomogeneous random graphs
- Nonuniversality of weighted random graphs with infinite variance degree
- High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- The phase transition in inhomogeneous random graphs
- Greedy Routing and the Algorithmic Small-World Phenomenon
- Explosiveness of age-dependent branching processes
This page was built for publication: Penalising transmission to hubs in scale-free spatial random graphs
