Related papers: Decoupling inequalities and interlacement percolat…
We consider random interlacements on $\mathbb{Z}^d$, $d \ge 3$. We show that the percolation function that to each $u \ge 0$ attaches the probability that the origin does not belong to an infinite cluster of the vacant set at level $u$, is…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
In long-range percolation on $\mathbb{Z}^d$, we connect each pair of distinct points $x$ and $y$ by an edge independently at random with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
We investigate level-set percolation of the Gaussian free field on transient trees, for instance on super-critical Galton-Watson trees conditioned on non-extinction. Recently developed Dynkin-type isomorphism theorems provide a comparison…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
We study percolative properties of excursion processes and the discrete Gaussian free field (dGFF) in the planar unit disk. We consider discrete excursion clouds, defined using random walks as a two-dimensional version of random…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
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 prove decoupling inequalities for the Gaussian free field on $\mathbb{Z}^d$, $d\geq 3$. As an application, we obtain exponential decay (with logarithmic correction for $d=3$) of the connectivity function of excursion sets for large…
We study the percolation properties of the growing clusters model. In this model, a number of seeds placed on random locations on a lattice are allowed to grow with a constant velocity to form clusters. When two or more clusters eventually…
We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model, and the loop $\mathrm{O}$(1) model. In this paper, we first prove that the uniform even subgraph of $Z^d$ percolates for…
We study the critical properties of the monopole-percolation transition in U(1) lattice gauge theory coupled to scalars at infinite ($\beta=0$) gauge coupling. We find strong scaling corrections in the critical exponents that must be…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…