Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0903.4496

Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters

Michael Damron·Artem Sapozhnikov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study invasion percolation in two dimensions, focusing on properties of the outlets of the invasion and their relation to critical percolation and to incipient infinite clusters (IIC's). First we compute the exact decay rate of the distribution of both the weight of the kth outlet and the volume of the kth pond. Next we prove bounds for all moments of the distribution of the number of outlets in an annulus. This result leads to almost sure bounds for the number of outlets in a box B(2^n) and for the decay rate of the weight of the kth outlet to p_c. We then prove existence of multiple-armed IIC measures for any number of arms and for any color sequence which is alternating or monochromatic. We use these measures to study the invaded region near outlets and near edges in the invasion backbone far from the origin.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Michael Damron, Artem Sapozhnikov. 2009-03-26. Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters. https://doi.org/10.1007/s00440-010-0274-y

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗