SearcharxivSearch

arXiv · math/0508459

The sizes of the pioneering, lowest crossing and pivotal sites in critical percolation on the triangular lattice

Abstract

Let L_n denote the lowest crossing of a square 2n\times2n box for critical site percolation on the triangular lattice imbedded in Z^2. Denote also by F_n the pioneering sites extending below this crossing, and Q_n the pivotal sites on this crossing. Combining the recent results of Smirnov and Werner [Math. Res. Lett. 8 (2001) 729-744] on asymptotic probabilities of multiple arm paths in both the plane and half-plane, Kesten's [Comm. Math. Phys. 109 (1987) 109-156] method for showing that certain restricted multiple arm paths are probabilistically equivalent to unrestricted ones, and our own second and higher moment upper bounds, we obtain the following results. For each positive integer τ, as n\to\infty: 1. E(|L_n|^τ)=n^{4τ/3+o(1)}. 2. E(|F_n|^τ)=n^{7τ/4+o(1)}. 3. E(|Q_n|^τ)=n^{3τ/4+o(1)}. These results extend to higher moments a discrete analogue of the recent results of Lawler, Schramm and Werner [Math. Res. Lett. 8 (2001) 401-411] that the frontier, pioneering points and cut points of planar Brownian motion have Hausdorff dimensions, respectively, 4/3, 7/4 and 3/4.

Explore related subjects

Keep this discovery

BibTeXRIS

G. J. Morrow, Y. Zhang. 2005-08-24. The sizes of the pioneering, lowest crossing and pivotal sites in critical percolation on the triangular lattice. https://doi.org/10.1214/105051605000000241

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