Search arXivSearch

arXiv · 2301.11248

Superconcentration for minimal surfaces in first passage percolation and disordered Ising ferromagnets

Abstract

We consider the standard first passage percolation model on $\mathbb Z^ d$ with a distribution $G$ taking two values $0<a<b$. We study the maximal flow through the cylinder $[0,n]^ {d-1}\times [0,hn]$ between its top and bottom as well as its associated minimal surface(s). We prove that the variance of the maximal flow is superconcentrated, i.e. in $O(\frac {n^{d-1}} {\log n})$, for $h\geq h_0$ (for a large enough constant $h_0=h_0(a,b)$). Equivalently, we obtain that the ground state energy of a disordered Ising ferromagnet in a cylinder $[0,n]^ {d-1}\times [0,hn]$ is superconcentrated when opposite boundary conditions are applied at the top and bottom faces and for a large enough constant $h\geq h_0$ (which depends on the law of the coupling constants). Our proof is inspired by the proof of Benjamini--Kalai--Schramm. Yet, one major difficulty in this setting is to control the influence of the edges since the averaging trick used in the proof of Benjamini--Kalai--Schramm fails for surfaces. Of independent interest, we prove that minimal surfaces (in the present discrete setting) cannot have long thin chimneys.

Explore related subjects

Keep this discovery

BibTeXRIS

Barbara Dembin, Christophe Garban. 2023-01-26. Superconcentration for minimal surfaces in first passage percolation and disordered Ising ferromagnets. https://arxiv.org/abs/2301.11248

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR