Related papers: Component sizes in the supercritical percolation o…

Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…

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…

We show that the size distributions of fragments created by high energy nuclear collisions are remarkably well reproduced within the framework of a parameter free percolation model. We discuss two possible scenarios to explain this…

We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…

Crossing probabilities for critical 2-D percolation on large but finite lattices have been derived via boundary conformal field theory. These predictions agree very well with numerical results. However, their derivation is heuristic and…

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…

We obtain upper bounds on the cardinality of Hilbert cubes in finite fields, which avoid large product sets and reciprocals of sum sets. In particular, our results replace recent estimates of N. Hegyv\'ari and P. P. Pach (2020), which…

We consider the three new crossing probabilities for percolation recently found via conformal field theory by Simmons, Kleban and Ziff. We prove that all three of them (i) may be simply expressed in terms of Cardy's and Watts' crossing…

We provide a new proof of the near-critical scaling relation $\beta=\xi_1\nu$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather…

While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…

Recently, Scullard and Ziff noticed that a broad class of planar percolation models are self-dual under a simple condition that, in a parametrized version of such a model, reduces to a single equation. They state that the solution of the…

For two-dimensional percolation at criticality, we discuss the inequality $\alpha_4 > 1$ for the polychromatic four-arm exponent (and stronger versions, the strongest so far being $\alpha_4 \geq 1 + \frac{\alpha_2}{2}$, where $\alpha_2$…

We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…

We consider a multiscale Boolean percolation on $\mathbb R^d$ with radius distribution $\mu$ on $[1,+\infty)$, $d\ge 2$. The model is defined by superposing the original Boolean percolation model with radius distribution $\mu$ with a…

In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as "percolation of words". We give a positive answer to their Open Problem 2: almost surely, all…

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…