BOOTSTRAP PERCOLATION ON RANDOM GEOMETRIC GRAPHS
From MaRDI portal
Publication:5416368
DOI10.1017/S0269964813000405zbMath1288.05247arXiv1201.2953MaRDI QIDQ5416368
Publication date: 20 May 2014
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.2953
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization ⋮ Bootstrap percolation in random geometric graphs ⋮ Mean curvature, threshold dynamics, and phase field theory on finite graphs ⋮ Accelerated information dissemination on networks with local and global edges ⋮ Bootstrap percolation on the stochastic block model
Cites Work
- Bootstrap percolation on the random graph \(G_{n,p}\)
- The longest edge of the random minimal spanning tree
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Finite size scaling in three-dimensional bootstrap percolation
- Bootstrap percolation and diffusion in random graphs with given vertex degrees
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Bootstrap percolation on the random regular graph
- Metastability effects in bootstrap percolation
- Random Plane Networks
- A Simple Growth Model for the Diffusion of a New Communication Service
- Random Geometric Graphs
- A simple model of global cascades on random networks
- The sharp threshold for bootstrap percolation in all dimensions
- Random Graphs
This page was built for publication: BOOTSTRAP PERCOLATION ON RANDOM GEOMETRIC GRAPHS