Exponential decay of connectivity and uniqueness in percolation on finite and infinite graphs
Abstract
We give an upper bound for the uniqueness transition on an arbitrary locally finite graph G in terms of the limit of the spectral radii [ H( Gt)] of the non-backtracking (Hashimoto) matrices for an increasing sequence of subgraphs Gt⊂ Gt+1 which converge to G. With the added assumption of strong local connectivity for the oriented line graph (OLG) of G, connectivity on any finite subgraph G'⊂ G decays exponentially for p<([ H( G)])-1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.