SearcharxivSearch

arXiv · 2204.06592

Fluctuation bounds for first-passage percolation on the square, tube, and torus

Abstract

In first-passage percolation, one assigns i.i.d. nonnegative weights $(t_e)$ to the edges of $\mathbb{Z}^d$ and studies the induced distance (passage time) $T(x,y)$ between vertices $x$ and $y$. It is known that for $d=2$, the fluctuations of $T(x,y)$ are at least order $\sqrt{\log |x-y|}$ under mild assumptions on $t_e$. We study the question of fluctuation lower bounds for $T_n$, the minimal passage time between two opposite sides of an $n$ by $n$ square. The main result is that, under a curvature assumption, this quantity has fluctuations at least of order $n^{1/8-\epsilon}$ for any $\epsilon>0$ when the $t_e$ are exponentially distributed. As previous arguments to bound the fluctuations of $T(x,y)$ only give a constant lower bound for those of $T_n$ (even assuming curvature), a different argument, representing $T_n$ as a minimum of cylinder passage times, and deriving more detailed information about the distribution of cylinder times using the Markov property, is developed. As a corollary, we obtain the first polynomial lower bounds on higher central moments of the discrete torus passage time, under the same curvature assumption.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Damron, Christian Houdré, Alperen Özdemir. 2022-04-13. Fluctuation bounds for first-passage percolation on the square, tube, and torus. https://arxiv.org/abs/2204.06592

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