• Corpus ID: 117955923

Spectral bounds for percolation on directed and undirected graphs

@article{Hamilton2015SpectralBF,
  title={Spectral bounds for percolation on directed and undirected graphs},
  author={Kathleen E. Hamilton and Leonid P. Pryadko},
  journal={arXiv: Mathematical Physics},
  year={2015}
}
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 Citations

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

We give an upper bound for the uniqueness transition on an arbitrary locally finite graph ${\cal G}$ in terms of the limit of the spectral radii $\rho\left[ H({\cal G}_t)\right]$ of the

References

SHOWING 1-10 OF 13 REFERENCES

Percolation and random graphs

In this chapter, we define percolation and random graph models, and survey the features of these models

Random graphs

  • A. Frieze
  • Mathematics, Computer Science
    SODA '06
  • 2006
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.

Tight lower bound for percolation threshold on an infinite graph.

A constructive proof for existence of such an eigenvalue in the case of a connected infinite quasitransitive graph, a graph-theoretic analog of a translationally invariant system is given.

Approximating the largest eigenvalue of network adjacency matrices.

Approximations to the largest eigenvalue of adjacency matrices of a network are developed and the relationships between these approximations are discussed.

Weighted percolation on directed networks.

An analysis of the percolation transition for general node removal strategies valid for locally treelike directed networks and applicable to situations not covered by previous works is presented.

Zeta Functions of Finite Graphs

Poles of the Ihara zeta function associated with a fi- nite graph are described by graph-theoretic quantities. Elementary proofs based on the notions of oriented line graphs, Perron-Frobenius

Network robustness and fragility: percolation on random graphs.

This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.

Percolation on dense graph sequences.

In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs (G n ). Let λn be the largest eigenvalue of the adjacency matrix of G n , and let G n (p n ) be the

Percolation on sparse networks

Percolation is reformulate as a message passing process and the resulting equations can be used to calculate the size of the percolating cluster and the average cluster size, finding them to be highly accurate when compared with direct numerical simulations.

Threshold conditions for arbitrary cascade models on arbitrary networks

The G2-threshold (twice generalized) theorem is shown, which nicely de-couples the effect of the topology and the virus model and has broad implications for the vulnerability of real, complex networks and numerous applications, including viral marketing, blog dynamics, influence propagation, easy answers to ‘what-if’ questions, and simplified design and evaluation of immunization policies.