Search arXivSearch

arXiv · 2102.06446

Fully-connected bond percolation on $\mathbb{Z}^d$

Abstract

We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to have a unique open connected component (bounded or unbounded). The model is defined on $\mathbb{Z}^d$ by passing to the limit for a sequence of finite volume models with general boundary conditions. Several questions and problems are investigated: existence, uniqueness, phase transition, DLR equations. Our main result involves the existence of a threshold $0<p^*(d)<1$ such that any infinite volume process is necessary the vacuum state in subcritical regime (no open edges) and is non trivial in the supercritical regime (existence of a stationary unbounded connected cluster). Bounds for $p^*(d)$ are given and show that it is drastically smaller than the standard bond percolation threshold in $\mathbb{Z}^d$. For instance $0.128<p^*(2)<0.202$ (rigorous bounds) whereas the 2D bond percolation threshold is equal to $1/2$.

Explore related subjects

Keep this discovery

BibTeXRIS

David Dereudre. 2021-02-12. Fully-connected bond percolation on $\mathbb{Z}^d$. https://arxiv.org/abs/2102.06446

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