Related papers: Monotonicity and phase diagram for multi-range per…
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…
Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.
In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…
The universality of the crossing probability $\pi_{hs}$ of a system to percolate only in the horizontal direction, was investigated numerically by using a cluster Monte-Carlo algorithm for the $q$-state Potts model for $q=2,3,4$ and for…
In this short note, we revisit a number of classical result{s} on long-range 1D percolation, Ising model and Potts models [FS82, NS86, ACCN88, IN88]. More precisely, we show that for Bernoulli percolation, FK percolation and Potts models,…
Consider the class of k-independent bond, respectively site, percolations with parameter p on an infinite tree T. We derive tight bounds on p for both a.s. percolation and a.s. nonpercolation. The bounds are continuous functions of k and…
Consider independent bond percolation with retention probability p on a spherically symmetric tree Gamma. Write theta_Gamma(p) for the probability that the root is in an infinite open cluster, and define the critical value…
We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or…
The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
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 ground-state of an infinite-range Potts glass-type model with +/- J bonds and unrestricted number of states is used to investigate coalition formation. As a function of the q probability of +J bonds in the system it is found that the r…
We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
Arboreal Gas is a type of (unrooted) random forest on a graph, where the probability is determined by a parameter $\beta>0$ per edge. This model is essentially equivalent to acyclic Bernoulli bond percolation with a parameter…
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…
This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such…
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…