SearcharxivSearch

arXiv · 2311.12780

Exact cube-root fluctuations in an area-constrained random walk model

Abstract

This article is devoted to the study of the behaviour of a (1+1)-dimensional model of random walk conditioned to enclose an area of order $N^2$. Such a conditioning enforces a globally concave trajectory. We study the local deviations of the walk from its convex hull. To this end, we introduce two quantities -- the mean facet length $\mathsf{MeanFL}$ and the mean local roughness $\mathsf{MeanLR}$ -- measuring the typical longitudinal and transversal fluctuations around the boundary of the convex hull of the random walk. Our main result is that $\mathsf{MeanFL}$ is of order $N^{2/3}$ and $\mathsf{MeanLR}$ is of order $N^{1/3}$. Moreover, following the strategy of Hammond (Ann. Prob., 2012), we identify the polylogarithmic corrections in the scaling of the maximal facet length and of the maximal local roughness, showing that the former one scales as $N^{2/3}(\log N)^{1/3}$, while the latter scales as $N^{1/3}(\log N)^{2/3}$. The object of study is intended to be a toy model for the interface of a two-dimensional statistical mechanics model (such as the Ising model) in the phase separation regime -- we discuss this issue at the end of this work.

Explore related subjects

Keep this discovery

BibTeXRIS

Lucas D'Alimonte, Romain Panis. 2023-11-21. Exact cube-root fluctuations in an area-constrained random walk model. https://arxiv.org/abs/2311.12780

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