Related papers: Critical percolation in the plane

We show the convergence of the single sourceless critical random current to a limit identifiable with the nested CLE(3). Our approach is based on viewing the random current as a perturbation of the Ising interface, which is known to…

We construct discrete holomorphic observables in the Ising model at criticality and show that they have conformally covariant scaling limits (as mesh of the lattice tends to zero). In the sequel those observables are used to construct…

In this review paper, we first discuss some open problems related to two-dimensional self-avoiding paths and critical percolation. We then review some closely related results (joint work with Greg Lawler and Oded Schramm) on critical…

We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on…

We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…

In this work, we study the random metric for the critical long-range percolation on $\mathbb{Z}^d$. A recent work by B\"aumler [3] implies the subsequential scaling limit, and our main contribution is to prove that the subsequential limit…

This is the first of two papers devoted to the proof of conformal invariance of the critical double random current model on the square lattice. More precisely, we show the convergence of loop ensembles obtained by taking the cluster…

We study limit laws for simple random walks on supercritical long-range percolation clusters on the integer lattice. For the long range percolation model, the probability that two vertices are connected behaves asymptotically as a negative…

We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…

We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper…

We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at/near critical external fields. We show that all scaling relations, except a single hyperscaling relation, hold under the power…

It is widely believed that the celebrated 2D Ising model at criticality has a universal and conformally invariant scaling limit, which is used in deriving many of its properties. However, no mathematical proof of universality and conformal…

Using the randomized algorithm method developed by Duminil-Copin, Raoufi and Tassion (2019b), we exhibit sharp phase transition for the confetti percolation model. This provides an alternate proof, than that of Ahlberg, Tassion and Texeira…

The rigidity transition occurs when, as the density of microscopic components is increased, a disordered medium becomes able to transmit and ensure macroscopic mechanical stability, owing to the appearance of a space-spanning rigid…

An universal invariant for site and bond percolation thresholds (p_{cs} and p_{cb} respectively) is proposed. The invariant writes {p_{cs}}^{1/a_s}{p_{cb}}^{-1/a_b}=\delta/d where a_s, a_b and \delta are positive constants,and d the space…

Using finite-size scaling methods we measure the thermal and magnetic exponents of the site percolation in four dimensions, obtaining a value for the anomalous dimension very different from the results found in the literature. We also…

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…

Statistical systems near a classical critical point have been intensively studied both from theoretical and experimental points of view. In particular, correlation functions are of relevance in comparing theoretical models with the…

Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…