Bootstrap percolation on geometric inhomogeneous random graphs
From MaRDI portal
Publication:4598290
DOI10.4230/LIPIcs.ICALP.2016.147zbMath1388.68234arXiv1603.02057OpenAlexW2963695164MaRDI QIDQ4598290
Christoph Koch, Johannes Lengler
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1603.02057
bootstrap percolationscale-free networkgeometric inhomogeneous random graphslocalised infection processmetastability threshold
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)
Related Items (17)
Spectral gap of random hyperbolic graphs and related parameters ⋮ A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs ⋮ Strong-majority bootstrap percolation on regular graphs with low dissemination threshold ⋮ Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square ⋮ Scale-free percolation mixing time ⋮ Bootstrap percolation in random geometric graphs ⋮ Greed is good for deterministic scale-free networks ⋮ Geometric inhomogeneous random graphs ⋮ Majority rule cellular automata ⋮ Color War: Cellular Automata with Majority-Rule ⋮ Polluted bootstrap percolation with threshold two in all dimensions ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Accelerated information dissemination on networks with local and global edges
This page was built for publication: Bootstrap percolation on geometric inhomogeneous random graphs
