Tight lower bound for percolation threshold on a quasi-regular graph

Abstract

We construct an exact expression for the site percolation threshold p_c on a quasi-regular tree, and a related exact lower bound for a quasi-regular graph. Both are given by the inverse spectral radius of the appropriate Hashimoto matrix used to count non-backtracking walks. The obtained bound always exceeds the inverse spectral radius of the original graph, and it is also generally tighter than the existing bound in terms of the maximum degree.

5 pages, 2 figures

References in corpus (6)

• Random graphs with clustering
• Networks and the Epidemiology of Infectious Disease
• Percolation on sparse networks
• Percolation on correlated networks
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Weighted percolation on directed networks

Cited by in corpus (7)

• Unification of theoretical approaches for epidemic spreading on complex networks
• Percolation on sparse networks
• Percolation in real interdependent networks
• Predicting percolation thresholds in networks
• Epidemic spreading and bond percolation in multilayer networks
• Percolation in real multiplex networks
• Assessing node risk and vulnerability in epidemics on networks