pith. sign in

arxiv: 2507.02676 · v3 · pith:IMJ6YPCFnew · submitted 2025-07-03 · 🧮 math.PR

On Loops in critical high-dimensional percolation

classification 🧮 math.PR
keywords loopspercolationself-avoidingclusterscriticaldiameterlargeside-length
0
0 comments X
read the original abstract

We show the following results about critical Bernoulli percolation in high dimensions: In a box of side-length N, there exist self-avoiding open loops of diameter comparable to N, and the collection of these self-avoiding loops has a non-trivial scaling limit (if viewed in the Hausdorff topology) as N tends to infinity. This feature contrasts with the proliferation of "typical" percolation clusters pointed out by Michael Aizenman almost three decades ago. In other words, we show that among the many large clusters in a large box, only a handful will contain a self-avoiding loop of diameter greater than a fixed fraction of the side-length of the box.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On reversing the Simon-Lieb inequality in high-dimensional percolation

    math.PR 2026-05 unverdicted novelty 5.0

    A partial reversal of the Simon-Lieb inequality is shown for high-dimensional percolation, implying uniform boundedness of phi_pc(S) and several critical estimates.