Spectral bounds for percolation on directed and undirected graphs

Abstract

We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.

2 pages; abstract for 2015 SIAM workshop on network theory

References in corpus (3)

• Percolation on sparse networks
• Approximating the largest eigenvalue of network adjacency matrices
• Weighted percolation on directed networks

Cited by in corpus (1)

• Exponential decay of connectivity and uniqueness in percolation on finite and infinite graphs