betaFeedback

WorksMathematics

Tightness of bulk crossing heights for the planar discrete Gaussian free field

Abstract

Let ϕNϕ_N be the planar discrete Gaussian free field in [−2N,2N]2∩Z2[-2N,2N]^2\cap\mathbb Z^2, with zero boundary condition imposed by killing the associated simple random walk on exit. We consider the least height HNH_N at which the two-sided level set {∣ϕN∣≤a}\{|ϕ_N|\leq a\} contains a nearest-neighbor left–right crossing of [−N,N]2∩Z2[-N,N]^2\cap\mathbb Z^2. We prove that (HN)N≥1(H_N)_{N\geq1} is tight, uniformly over all box sizes. More precisely, for every a≥0a\geq0 and N≥1N\geq1, Φ ⁣(−a2log⁡2)≤P(HN>a)≤4exp⁡ ⁣{−2−29a2log⁡(2+a)}, Φ\!\left(-a\sqrt{\frac{2}{\log2}}\right) \leq\mathbb{P}(H_N>a) \leq4\exp\!\left\{-2^{-29}\frac{a^2}{\log(2+a)}\right\}, where ΦΦ is the standard normal distribution function. The upper bound yields uniform polynomial moments and a uniform exponential moment of HN2/log⁡(2+HN)H_N^2/\log(2+H_N). For the upper bound, we compare a marked loop-soup exploration with a graph in which independent site variables open incoming edges. We then estimate connections in a massive field using two auxiliary vertices and bound the Gaussian remainder when the mass is removed. The lower bound uses a Gaussian translation inequality and a square-shell estimate for the Dirichlet energy, without using the massive-field argument. In particular, a height independent of NN gives any prescribed crossing probability below one, whereas every fixed finite height has a uniformly positive failure probability.

Paper details

vlnc:W_xmuk4vrb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…