SearcharxivSearch

arXiv · 2503.12471

On minimizing curves in a Brownian potential

Abstract

We study a $(1+1)$-dimensional semi-discrete random variational problem that can be interpreted as the geometrically linearized version of the critical $2$-dimensional random field Ising model. The scaling of the correlation length of the latter was recently characterized in [12] and [13, Section 5]; our analysis is reminiscent of the multi-scale approach of the latter work and of [20]. We show that at every dyadic scale from the system size down to the lattice spacing the minimizer contains at most order-one Dirichlet energy per unit length. We also establish a quenched homogenization result in the sense that the leading order of the minimal energy becomes deterministic as the ratio system size / lattice spacing diverges. To this purpose we adapt arguments from [9] on the $(d+1)$-dimensional version our the model, with a Brownian replacing the white noise potential, to obtain the initial large-scale bounds. Based on our estimate of the $(p=3)$-Dirichlet energy, we give an informal justification of the geometric linearization. Our bounds, which are oblivious to the microscopic cut-off scale provided by the lattice spacing, yield tightness of the law of minimizers in the space of continuous functions as the lattice spacing is sent to zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Felix Otto, Matteo Palmieri, Christian Wagner. 2025-03-16. On minimizing curves in a Brownian potential. https://doi.org/10.1007/s00440-026-01468-y

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