Related papers: Spatial moments for high-dimensional critical cont…

We consider the critical spread-out contact process in $\Zd$ with $d\geq 1$, whose infection range is denoted by $L\geq1$. The two-point function $\tau_t(x)$ is the probability that $x\in\Zd$ is infected at time $t$ by the infected…

We study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…

We prove that the Fourier transform of the properly-scaled normalized two-point function for sufficiently spread-out long-range oriented percolation with index \alpha>0 converges to e^{-C|k|^{\alpha\wedge2}} for some C\in(0,\infty) above…

Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…

The supercritical series expansion of the survival probability for the one-dimensional contact process in heterogeneous and disordered lattices is used for the evaluation of the loci of critical points and critical exponents $\beta$. The…

We provide a complete proof of the diagrammatic bounds on the lace-expansion coefficients for oriented percolation, which are used in [arXiv:math/0703455] to investigate critical behavior for long-range oriented percolation above…

In this paper we investigate the survival probability, \theta_n, in high-dimensional statistical physical models, where \theta_n denotes the probability that the model survives up to time n. We prove that if the r-point functions scale to…

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…

We use the lace expansion to prove an infra-red bound for site percolation on the hypercubic lattice in high dimension. This implies the triangle condition and allows us to derive several critical exponents that characterize mean-field…

We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…

In a recent paper (arXiv:0911.2514), one of us (FYW) considered the Potts model and bond and site percolation on two general classes of two-dimensional lattices, the triangular-type and kagome-type lattices, and obtained closed-form…

We present high statistics simulations of weighted lattice bond animals and lattice trees on the square lattice, with fugacities for each non-bonded contact and for each bond between two neighbouring monomers. The simulations are performed…

A spread-out lattice animal is a finite connected set of edges in $\{ \{x,y\} \subset \mathbb{Z}^d:0<||x-y||\le L \}$. A lattice tree is a lattice animal with no loops.The best estimate on the critical point $p_c$ so far was achieved by…

We postulate the existence of a natural Poissonian marking of the double (touching) points of SLE(6) and hence of the related continuum nonsimple loop process that describes macroscopic cluster boundaries in 2D critical percolation. We…

We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…

We prove that near-critical percolation and dynamical percolation on the triangular lattice $\eta \mathbb{T}$ have a scaling limit as the mesh $\eta \to 0$, in the "quad-crossing" space $\mathcal{H}$ of percolation configurations introduced…

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

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…

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…