SearcharxivSearch

arXiv · 2007.00539

A note on the phase transition for independent alignment percolation

Abstract

We study the independent alignment percolation model on $\mathbb{Z}^d$ introduced by Beaton, Grimmett and Holmes [arXiv:1908.07203]. It is a model for random intersecting line segments defined as follows. First the sites of $\mathbb{Z}^d$ are independently declared occupied with probability $p$ and vacant otherwise. Conditional on the configuration of occupied vertices, consider the set of all line segments that are parallel to the coordinate axis, whose extremes are occupied vertices and that do not traverse any other occupied vertex. Declare independently the segments on this set open with probability $\lambda$ and closed otherwise. All the edges that lie on open segments are also declared open giving rise to a bond percolation model in $\mathbb{Z}^d$. We show that for any $d \geq 2$ and $p \in (0,1]$ the critical value for $\lambda$ satisfies $\lambda_c(p)<1$ completing the proof that the phase transition is non-trivial over the whole interval $(0,1]$. We also show that the critical curve $p \mapsto \lambda_c(p)$ is continuous at $p=1$, answering a question posed by the authors in [arXiv:1908.07203].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcelo Hilário, Daniel Ungaretti. 2020-07-01. A note on the phase transition for independent alignment percolation. https://doi.org/10.3150/21-bej1395

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