Related papers: Critical probabilities for positively associated, …

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…

We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we…

We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…

We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate 1, and clusters freeze at rate \alpha independently of their size. Our main result is that the infinite volume process can be…

We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…

Tree models for rigidity percolation are introduced and solved. A probability vector describes the propagation of rigidity outward from a rigid border. All components of this ``vector order parameter'' are singular at the same rigidity…

For the Gaussian free field on a $(d + 1)$-regular tree with $d \geq 2$, we study the percolative properties of its level sets in the critical and the near-critical regime. In particular, we show the continuity of the percolation…

Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…

Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…

We study the topology of a random cubical complex associated to Bernoulli site percolation on a cubical grid. We begin by establishing a limit law for homotopy types. More precisely, looking within an expanding window, we define a sequence…

We study the near-critical FK-Ising model. First, a determination of the correlation length defined via crossing probabilities is provided. Second, a phenomenon about the near-critical behavior of FK-Ising is highlighted, which is…

Survival and percolation probabilities are most important quantities in the theory and in the application of growth models with spreading. We construct field theoretical expressions for these probabilities which are feasible for…

In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The proof relies on a recent extension of the classical framework of Toom. This…

We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…

We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…

This paper studies a number of matrix models of size n and the associated Markov chains for the eigenvalues of the models for consecutive n's. They are consecutive principal minors for two of the models, GUE with external source and the…

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…

Disagreement percolation connects a Gibbs lattice gas and i.i.d. site percolation on the same lattice such that non-percolation implies uniqueness of the Gibbs measure. This work generalises disagreement percolation to the hard-sphere model…

We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infinite third moment. The scaling limit of the critical…