Related papers: 1+O(1) asymptotics for loop percolation in five an…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…
In this work we consider the two-dimensional percolation model arising from the majority dynamics process at a given time $t\in\mathbb{R}_+$. We show the emergence of a sharp threshold phenomenon for the box crossing event at the critical…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson…
Grimmett's random-orientation percolation is formulated as follows. The square lattice is used to generate an oriented graph such that each edge is oriented rightwards (resp. upwards) with probability $p$ and leftwards (resp. downwards)…
The aim of this short article is to convey the basic idea of the original paper [3], without going into too much detail, about how to derive sharp asymptotics of the gyration radius for random walk, self-avoiding walk and oriented…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
We study $N$-cluster correlation functions in four- and five-dimensional (4D, 5D) bond percolation by extensive Monte Carlo simulation. We reformulate the transfer Monte Carlo algorithm for percolation [Phys. Rev. E {\bf 72}, 016126 (2005)]…
For random percolation at p_c, the probability distribution P(n) of the number of spanning clusters (n) has been studied in large scale simulations. The results are compatible with $P(n) \sim \exp(-an^2)$ for all dimensions. We also study…
Scale-invariant universal crossing probabilities are studied for critical anisotropic systems in two dimensions. For weakly anisotropic standard percolation in a rectangular-shaped system, Cardy's exact formula is generalized using a…
On the lattice $\widetilde{\mathbb Z}^2_+:={(x,y)\in \mathbb Z \times \mathbb Z_+\colon x+y \text{is even}}$ we consider the following oriented (northwest-northeast) site percolation: the lines $H_i:={(x,y)\in \widetilde {\mathbb Z}^2_+…
Using the recent six loop renormalization group functions for Lee-Yang and percolation theory constructed by Schnetz from a scalar cubic Lagrangian, we deduce the $\epsilon$ expansion of the critical exponents for both cases. Estimates for…
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…
In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…
We study site- and bond-percolation on a class of lattices referred to as Lieb lattices. In two dimensions the Lieb lattice (LL) is also known as the decorated square lattice, or as the CuO$_2$ lattice; in three dimensions it can be…
We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…
We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx…
We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…