SearcharxivSearch

arXiv · 2609.08726

Asymptotics of a planar isoperimetric problem with a white-noise volume term

Abstract

In this work we study the maximal ratio $I$ between the white noise integrated over a set and the perimeter of the set, which can be seen as a random isoperimetric problem, and appears in the random-field Ising model (Ding-Wirth) and min-max optimal matching (Leighton-Shor). In the planar case considered here, such a ratio is scale-invariant and therefore the problem is critical. As such it requires an ultraviolet cutoff, which we impose by restricting to polygonal sets with side-length at least 1 contained in the ball $B_L$. Our main result establishes the leading-order asymptotics $\mathbb{E}I\approx i\ln^{3/4}L$ for some $i\in(0,\infty)$ and superconcentration at scale $O(\ln^{-1/4}L)$. This is done by relating to a simpler $(1+1)$-dimensional action, studied by the last two authors and C. Wagner. Such a connection is found by a classical geometric linearization of the perimeter to the Dirichlet energy, justified by Ried-Wagner large-scale regularity theory, and allows a coarse-graining and scale-by-scale iteration argument.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaopeng Cheng, Felix Otto, Matteo Palmieri. 2026-09-08. Asymptotics of a planar isoperimetric problem with a white-noise volume term. https://arxiv.org/abs/2609.08726

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