Related papers: Directed Percolation and the Golden Ratio
We study mixed site-bond directed percolation on 2D and 3D lattices by using time-dependent simulations. Our results are compared with rigorous bounds recently obtained by Liggett and by Katori and Tsukahara. The critical fractions…
Recently, an exact Green's function of the diffusion equation for a pair of spherical interacting particles in two dimensions subject to a backreaction boundary condition was derived. Here, we use the obtained Green's function to calculate…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
The local persistence probability P_l(t) that a site never becomes active up to time t, and the global persistence probability P_g(t) that the deviation of the global density from its mean value rho(t)-<\rho(t)> does not change its sign up…
Let $A$ be an arc on the boundary of the unit disk $U$. We prove an asymptotic formula for the probability that there is a percolation cluster $K$ for critical site percolation on the triangular grid in $U$ which intersects $A$ and such…
The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
We prove that the Poisson-Boolean percolation on $\mathbb{R}^d$ undergoes a sharp phase transition in any dimension under the assumption that the radius distribution has a $5d-3$ finite moment (in particular we do not assume that the…
We have derived long series expansions of the percolation probability for site, bond and site-bond percolation on the directed triangular lattice. For the bond problem we have extended the series from order 12 to 51 and for the site problem…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary…
We consider two-dimensional percolation in the scaling limit close to criticality and use integrable field theory to obtain universal predictions for the probability that at least one cluster crosses between opposite sides of a rectangle of…
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,…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
Shape-dependent universal crossing probabilities are studied, via Monte Carlo simulations, for bond and site directed percolation on the square lattice in the diagonal direction, at the percolation threshold. Since the system is strongly…
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…
I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$…
We study the size of the near-critical window for Bernoulli percolation on $\mathbb Z^d$. More precisely, we use a quantitative Grimmett-Marstrand theorem to prove that the correlation length, both below and above criticality, is bounded…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…