Critical long-range percolation with logarithmically enhanced interactions

We study independent bond percolation on the integer lattice in dimension d ≥ 1, at the borderline decay power 2d. For a symmetric summable interaction bounded below by c r⁻²ᵈ (log(e+r))^κ at every nonzero displacement of length r, with 0 < βc < ∞, we prove that the critical infinite-cluster density vanishes whenever κ > 2. At criticality the probability that two uniform sites of a cube of side R are connected anywhere in the lattice is O((log R)^(1−κ/2)). A dyadic summability criterion also covers the logarithmic square with an extra factor (log log r)^γ for γ > 2. The proof follows vertices through successive mergers of clusters. At the bare square we prove that the probability of connecting the two sites inside an enclosing cube of side K tends to zero whenever K/R = o((log R)^(2/d)). Critical continuity at the bare square remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24330774
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Critical long-range percolation with logarithmically enhanced interactions

Yan Ru Pei
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Critical long-range percolation with logarithmically enhanced interactions

Yan Ru Pei
preprint en

Abstract

We study independent bond percolation on the integer lattice in dimension d ≥ 1, at the borderline decay power 2d. For a symmetric summable interaction bounded below by c r⁻²ᵈ (log(e+r))^κ at every nonzero displacement of length r, with 0 < βc < ∞, we prove that the critical infinite-cluster density vanishes whenever κ > 2. At criticality the probability that two uniform sites of a cube of side R are connected anywhere in the lattice is O((log R)^(1−κ/2)). A dyadic summability criterion also covers the logarithmic square with an extra factor (log log r)^γ for γ > 2. The proof follows vertices through successive mergers of clusters. At the bare square we prove that the probability of connecting the two sites inside an enclosing cube of side K tends to zero whenever K/R = o((log R)^(2/d)). Critical continuity at the bare square remains open.

Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon