arXiv:1610.04897 [math-ph]AbstractReferencesReviewsResources
Exponential decay of connectivity and uniqueness in percolation on finite and infinite graphs
Kathleen E. Hamilton, Leonid P. Pryadko
Published 2016-10-16Version 1
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 non-backtracking (Hashimoto) matrices for an increasing sequence of subgraphs ${\cal G}_t\subset{\cal G}_{t+1}$ which converge to ${\cal G}$. With the added assumption of strong local connectivity for the oriented line graph (OLG) of ${\cal G}$, connectivity on any finite subgraph ${\cal G}'\subset{\cal G}$ decays exponentially for $p<(\rho\left[ H({\cal G}^{\prime})\right])^{-1}$.
Comments: 2 pages. Abstract for the SIAM Workshop on Network Science (NS16), July 15-16, 2016, Boston, Massachusetts
Related articles: Most relevant | Search more
arXiv:1211.0948 [math-ph] (Published 2012-11-05)
Percolation on infinite graphs and isoperimetric inequalities
arXiv:1412.8326 [math-ph] (Published 2014-12-29)
Exponential decay of loop lengths in the loop $O(n)$ model with large $n$
arXiv:1104.2998 [math-ph] (Published 2011-04-15)
On the exponential decay of the Euler-Bernoulli beam with boundary energy dissipation