English

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

Mathematical Physics 2016-10-18 v1 Disordered Systems and Neural Networks math.MP

Abstract

We give an upper bound for the uniqueness transition on an arbitrary locally finite graph G{\cal G} in terms of the limit of the spectral radii ρ[H(Gt)]\rho\left[ H({\cal G}_t)\right] of the non-backtracking (Hashimoto) matrices for an increasing sequence of subgraphs GtGt+1{\cal G}_t\subset{\cal G}_{t+1} which converge to G{\cal G}. With the added assumption of strong local connectivity for the oriented line graph (OLG) of G{\cal G}, connectivity on any finite subgraph GG{\cal G}'\subset{\cal G} decays exponentially for p<(ρ[H(G)])1p<(\rho\left[ H({\cal G}^{\prime})\right])^{-1}.

Keywords

Cite

@article{arxiv.1610.04897,
  title  = {Exponential decay of connectivity and uniqueness in percolation on finite and infinite graphs},
  author = {Kathleen E. Hamilton and Leonid P. Pryadko},
  journal= {arXiv preprint arXiv:1610.04897},
  year   = {2016}
}

Comments

2 pages. Abstract for the SIAM Workshop on Network Science (NS16), July 15-16, 2016, Boston, Massachusetts