The disk-percolation model on graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5722221
- On percolation of two-dimensional hard disks
- Percolation on hyperbolic graphs
- Percolation in general graphs
- Percolation on sequences of graphs
- Percolation on dense graph sequences
- Dynamics ofk-core percolation in a random graph
- Percolation on nonunimodular transitive graphs
- Percolation on random graphs with a fixed degree sequence
- On percolation in random graphs with given vertex degrees
Cites work
- scientific article; zbMATH DE number 5159453 (Why is no real title available?)
- An improved upper bound for the critical probability of the frog model on homogeneous trees
- Continuum percolation with unreliable and spread-out connections
- Limit set of a weakly supercritical contact process on a homogeneous tree
- Long range percolation in stationary point processes
- Nearest neighbor and hard sphere models in continuum percolation
- On the spread-out limit for bond and continuum percolation
- Percolation
- Probability on trees and networks
- Random walks and percolation on trees
- Random walks systems with killing on ℤ
- Spread‐out percolation in ℝd
- The shape theorem for the frog model
- The supercritical Galton-Watson process in varying environments
Cited in
(8)- Rumor processes in random environment on \(\mathbb N\) and on Galton-Watson trees
- The rumor percolation model and its variations
- Boolean percolation on digraphs and random exchange processes
- The cone percolation on \(\mathbb{T}_{d}\)
- The cone percolation model on Galton-Watson and on spherically symmetric trees
- How fast do rumours spread?
- On percolation of two-dimensional hard disks
- Rumor Processes on N
This page was built for publication: The disk-percolation model on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730724)