相关论文: An upper bound for $p_c$ in range-$R$ bond percola…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…
We investigate a model of epidemic spreading with partial immunization which is controlled by two probabilities, namely, for first infections, $p_0$, and reinfections, $p$. When the two probabilities are equal, the model reduces to directed…
Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…
We perform large-scale simulations of the two-dimensional long-range bond percolation model with algebraically decaying percolation probabilities $\sim 1/r^{2+\sigma}$, using both conventional ensemble and event-based ensemble methods for…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. For any $\lambda>0$ we consider the percolation…
Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in…
We consider self-avoiding walk and percolation in $\Zd$, oriented percolation in $\Zd\times\Zp$, and the contact process in $\Zd$, with $p D(\cdot)$ being the coupling function whose range is denoted by $L<\infty$. For percolation, for…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…
The fractions of samples spanning a lattice at its percolation threshold are found by computer simulation of random site-percolation in two- and three-dimensional hypercubic lattices using different boundary conditions. As a byproduct we…
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. Cerf (2015) pointed out that from classical work by Aizenman, Kesten and Newman (1987) and Gandolfi, Grimmett and Russo (1988) one can obtain that the two-arms exponent…
We provide the first nontrivial upper bound for the chemical distance exponent in two-dimensional critical percolation. Specifically, we prove that the expected length of the shortest horizontal crossing path of a box of side length $n$ in…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
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…
We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O.…
We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…
A power law is postulated for both site and bond percolation thresholds. The formula writes $p_c=p_0[(d-1)(q-1)]^{-a}d^{\ b}$, where $d$ is the space dimension and $q$ the coordination number. All thresholds up to $d\rightarrow \infty$ are…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…