Isoperimetric lower bounds for critical exponents for long-range percolation
Abstract
We study independent long-range percolation on Zd where the vertices x and y are connected with probability 1-e-β\|x-y\|-d-α for α > 0. Provided the critical exponents δ and 2-η defined by δ = n ∞ -(n)(Pβc(|K0|≥ n)) and 2-η = x ∞ (Pβc(0 x))(\|x\|) + d exist, where K0 is the cluster containing the origin, we show that equation* δ ≥ d+(α 1)d-(α 1) \ and \ 2-η ≥ α 1 . equation* The lower bound on δ is believed to be sharp for d = 1, α ∈ [13,1) and for d = 2, α ∈ [23,1], whereas the lower bound on 2-η is sharp for d=1, α ∈ (0,1), and for α ∈ (0,1] for d>1, and is not believed to be sharp otherwise. Our main tool is a connection between the critical exponents and the isoperimetry of cubes inside Zd.
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.