Spectral bounds for percolation on directed and undirected graphs
classification
🧮 math-ph
math.MPphysics.soc-ph
keywords
boundsdirectedgraphspercolationproliferationundirectedalgebraicassociated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.