English

Supercritical long-range percolation on graphs of polynomial growth: the truncated one-arm exponent

Probability 2026-01-13 v1

Abstract

We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices xx and yy of the underlying graph GG connect by a direct edge with probability 1exp(βJ(x,y))1-\exp(-\beta J(x,y)), where J(x,y)J(x,y) is a function that is invariant under the automorphism group of GG, and we assume that JJ decays polynomially with the graph distance between xx and yy. We give up-to-constant bounds on the decay of the radius of finite cluster for β>βc\beta > \beta_c. In the same setting, we also give upper and lower bounds on the tail volume of finite clusters. The upper and lower bounds are of matching order, conjecturally on sharp volume bounds for spheres in transitive graphs of polynomial growth. As a corollary, we obtain a lower bound on the anchored isoperimetric dimension of the infinite component.

Keywords

Cite

@article{arxiv.2601.07808,
  title  = {Supercritical long-range percolation on graphs of polynomial growth: the truncated one-arm exponent},
  author = {Yago Moreno Alonso and Julia Komjathy},
  journal= {arXiv preprint arXiv:2601.07808},
  year   = {2026}
}

Comments

44 pages, 6 figures