Percolation Threshold - Percolation Thresholds of Graphs

Percolation Thresholds of Graphs

For random graphs not embedded in space the percolation threshold can be calculated exactly. For example for random regular graphs where all nodes have the same degree k, p_c=1/k. For Erdős–Rényi (ER) graphs with Poissonian degree distribution, p_c=1/. The critical threshold was calculated exactly also for interdependent ER networks.