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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2015
- DOI:
- 10.48550/arXiv.1503.00410
- arXiv:
- arXiv:1503.00410
- Bibcode:
- 2015arXiv150300410H
- Keywords:
-
- Mathematical Physics;
- Physics - Physics and Society
- E-Print:
- 2 pages