Critical percolation on the discrete torus in high dimensions

Abstract

We consider percolation on the discrete torus Znd at pc(Zd), the critical value for percolation on the corresponding infinite lattice Zd, and within the scaling window around it. We assume that d is a large enough constant for the nearest neighbor model, or any fixed d>6 for spread-out models. We prove that there exist constants C,C' depending only on the dimension and the spread-out parameter such that for any λ ∈ R if the edge probability is pc(Zd)+C λ n-d/3 + o(n-d/3), then the joint distribution of the largest clusters normalized by C' n-2d/3 converges as n ∞ to the ordered lengths of excursions above past minimum of an inhomogeneous Brownian motion started at 0 with drift λ-t at time t∈[0,∞). This canonical limit was identified by Aldous in the context of critical Erdos--R\'enyi graphs.

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…