Spectral bounds for percolation on directed and undirected graphs
Mathematical Physics
2015-03-03 v1 math.MP
Physics and Society
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.
Cite
@article{arxiv.1503.00410,
title = {Spectral bounds for percolation on directed and undirected graphs},
author = {Kathleen E. Hamilton and Leonid P. Pryadko},
journal= {arXiv preprint arXiv:1503.00410},
year = {2015}
}
Comments
2 pages; abstract for 2015 SIAM workshop on network theory