Critical cluster volumes in hierarchical percolation

Abstract

We consider long-range Bernoulli bond percolation on the d-dimensional hierarchical lattice in which each pair of points x and y are connected by an edge with probability 1-(-β\|x-y\|-d-α), where 0<α<d is fixed and β ≥ 0 is a parameter. We study the volume of clusters in this model at its critical point β=βc, proving precise estimates on the moments of all orders of the volume of the cluster of the origin inside a box. We apply these estimates to prove up-to-constants estimates on the tail of the volume of the cluster of the origin, denoted K, at criticality, namely \[ Pβc(|K|≥ n) cases n-(d-α)/(d+α) & d < 3α\\ n-1/2( n)1/4 & d=3α \\ n-1/2 & d>3α. cases \] In particular, we compute the critical exponent δ to be (d+α)/(d-α) when d is below the upper-critical dimension dc=3α and establish the precise order of polylogarithmic corrections to scaling at the upper-critical dimension itself. Interestingly, we find that these polylogarithmic corrections are not those predicted to hold for nearest-neighbour percolation on Z6 by Essam, Gaunt, and Guttmann (J. Phys. A 1978). Our work also lays the foundations for the study of the scaling limit of the model: In the high-dimensional case d ≥ 3α we prove that the sized-biased distribution of the volume of the cluster of the origin inside a box converges under suitable normalization to a chi-squared random variable, while in the low-dimensional case d<3α we prove that the suitably normalized decreasing list of cluster sizes in a box is tight in p \0\ if and only if p>2d/(d+α).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…