Search arXivSearch

arXiv · 0801.0967

Lower large deviations and laws of large numbers for maximal flows through a box in first passage percolation

Abstract

We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $τ$ between the lower half and the upper half of the box, and the maximal flow $ϕ$ between the top and the bottom of the box. A standard subadditive argument yields the law of large numbers for $τ$ in rational directions. Kesten and Zhang have proved the law of large numbers for $τ$ and $ϕ$ when the sides of the box are parallel to the coordinate hyperplanes: the two variables grow linearly with the surface $s$ of the basis of the box, with the same deterministic speed. We study the probabilities that the rescaled variables $τ/s$ and $ϕ/s$ are abnormally small. For $τ$, the box can have any orientation, whereas for $ϕ$, we require either that the box is sufficiently flat, or that its sides are parallel to the coordinate hyperplanes. We show that these probabilities decay exponentially fast with $s$, when $s$ grows to infinity. Moreover, we prove an associated large deviation principle of speed $s$ for $τ/s$ and $ϕ/s$, and we improve the conditions required to obtain the law of large numbers for these variables.

Explore related subjects

Keep this discovery

BibTeXRIS

Raphaël Rossignol, Marie Théret. 2009-07-03. Lower large deviations and laws of large numbers for maximal flows through a box in first passage percolation. https://arxiv.org/abs/0801.0967

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