2000 character limit reached
Spectral bounds for percolation on directed and undirected graphs
Published 2 Mar 2015 in math-ph, math.MP, and physics.soc-ph | (1503.00410v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.