Related papers: Subcritical Connectivity and Some Exact Tail Expon…
We present a random-matrix realization of a two-dimensional percolation model with the occupation probability $p$. We find that the behavior of the model is governed by the two first extreme eigenvalues. While the second extreme eigenvalue…
One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words, this equation means that for all values different from p_c of the parameter p the following holds: Either…
A one-dimensional diagonal tight binding electronic system with correlated disorder is investigated. The correlation of the random potential is exponentially decaying with distance and its correlation length diverges as the concentration of…
We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…
We investigate the behavior of large connected components in the Poisson Random Connection model in non-critical regimes with any bounded connection function. We show that the asymptotic size of the largest component restricted to a window…
We consider the Boolean model $Z$ on $\mathbb{R}^d$ with random compact grains, i.e. $Z := \bigcup_{i \in \mathbb{N}} (X_i + Z_i)$ where $\eta_t := \{X_1, X_2, \dots\}$ is a Poisson point process of intensity $t$ and $(Z_1, Z_2, \dots)$ is…
It is shown that the critical exponent $g_1$ related to pair-connectiveness and shortest-path (or chemical distance) scaling, recently studied by Porto et al., Dokholyan et al., and Grassberger, can be found exactly in 2d by using a…
Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…
We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…
We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…
We derive an estimate for the distance, measured in lattice spacings, inside two-dimensional critical percolation clusters from the origin to the boundary of the box of side length $2n$, conditioned on the existence of an open connection.…
Two-dimensional bootstrap percolation is a cellular automaton in which sites become 'infected' by contact with two or more already infected nearest neighbors. We consider these dynamics, which can be interpreted as a monotone version of the…
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
Consider supercritical long-range percolation on $\Z^d$ where two vertices $x,y \in \Z^d$ are connected with probability asymptotic to $\|x-y\|^{-s}$ for some $s>2d$. Conditioned that the origin is in the infinite cluster, we prove a shape…
We prove that for Bernoulli percolation on $\mathbb{Z}^d$, $d\geq 2$, the percolation density is an analytic function of the parameter in the supercritical interval. For this we introduce some techniques that have further implications. In…
We consider percolation on $\mathbb{Z}^d$ and on the $d$-dimensional discrete torus, in dimensions $d \ge 11$ for the nearest-neighbour model and in dimensions $d>6$ for spread-out models. For $\mathbb{Z}^d$, we employ a wide range of…