Related papers: Upper bounds on the percolation correlation length

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…

Long-range power-law correlated percolation is investigated using Monte Carlo simulations. We obtain several static and dynamic critical exponents as function of the Hurst exponent $H$ which characterizes the degree of spatial correlation…

We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…

We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

The lilypond model on a point process in $d$-space is a growth-maximal system of non-overlapping balls centred at the points. We establish central limit theorems for the total volume and the number of components of the lilypond model on a…

In this paper, we are interested in the loop cluster model on $\mathbb{Z}^d$ for $d\geq 3$. It is a long range model with two parameters $\alpha$ and $\kappa$, where the non-negative parameter $\alpha$ measures the amount of loops, and…

We consider the model of a directed polymer in a random environment defined on the infinite cluster of supercritical Bernoulli bond percolation in dimensions $d \geq 3$. For this model, it was proved in arXiv:2205.06206 that for almost…

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 consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of…

Monte-Carlo simulations on a variety of 2d percolating systems at criticality suggest that the excess number of clusters in finite systems over the bulk value of nc is a universal quantity, dependent upon the system shape but independent of…

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…

We prove that for Voronoi percolation on $\mathbb{R}^d$, there exists $p_c\in[0,1]$ such that - for $p<p_c$, there exists $c_p>0$ such that $\mathbb{P}_p[0\text{ connected to distance }n]\leq \exp(-c_p n)$, - there exists $c>0$ such that…

The Constrained-degree percolation model was introduced in [B.N.B. de Lima, R. Sanchis, D.C. dos Santos, V. Sidoravicius, and R. Teodoro, Stoch. Process. Appl. (2020)], where it was proven that this model has a non-trivial phase transition…

A random hopping on a fractal network with dimension slightly above one, $d = 1 + \epsilon$, is considered as a model of transport for conducting polymers with nonmetallic conductivity. Within the real space renormalization group method of…

The number of two-dimensional percolation clusters whose external hulls enclose an area greater than A, in a system of area Omega, behaves at the critical point as C \Omega /A for large A, where C = 1/(8 pi sqrt(3)). Here we show that away…

We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either…

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…

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…