Related papers: Planar percolation and the loop O(n) model

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…

We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following bond percolation. We use our theoretical result to find the…

We consider connectivity properties and asymptotic slopes for certain random directed graphs on $Z^2$ in which the set of points $C_o$ that the origin connects to is always infinite. We obtain conditions under which the complement of $C_o$…

Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-\epsilon) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1 and let G_A be the random graph with vertex set {x_i}…

We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…

In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is…

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…

We prove annealed scaling relations for planar Voronoi percolation. To our knowledge, this is the first result of this kind for a continuum percolation model. We are mostly inspired by the proof of scaling relations for Bernoulli…

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…

The well known bunkbed conjecture about percolation on finite graphs is now resolved; Gladkov, Pak and Zimin, building upon work of Hollom, have constructed a counterexample. We revisit this conjecture and study it in the broader context of…

The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two na\"ive solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with…

We use Coulomb gas methods to propose an explicit form for the scaling limit of the partition function of the critical O(n) model on an annulus, with free boundary conditions, as a function of its modulus. This correctly takes into account…

We study FK-percolation where the edge parameters are chosen as independent random variables in the near-critical regime. We show that if these parameters satisfy a natural centering condition around the critical point, then the quenched…

We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…

We numerically study the phase diagram and critical properties of the two-dimensional disordered O(n) loop model by using the transfer matrix and the worm Monte Carlo methods. The renormalization group flow is extracted from the landscape…

We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…