Related papers: Percolation on uniform infinite planar maps

Shape-dependent universal crossing probabilities are studied, via Monte Carlo simulations, for bond and site directed percolation on the square lattice in the diagonal direction, at the percolation threshold. Since the system is strongly…

Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…

We study longest and shortest directed paths in the following natural model of directed random planar maps: the uniform infinite bipolar-oriented triangulation (UIBOT), which is the local limit of uniform bipolar-oriented triangulations…

We consider the uniform infinite quadrangulation of the plane (UIPQ). Curien, M\'enard and Miermont recently established that in the UIPQ, all infinite geodesic rays originating from the root are essentially similar, in the sense that they…

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…

We prove Tsirelson's conjecture that any scaling limit of the critical planar percolation is a black noise. Our theorems apply to a number of percolation models, including site percolation on the triangular grid and any subsequential…

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…

Recently, the authors showed that the critical probability for random Voronoi percolation in the plane is 1/2. A by-product of the method was a short proof of the Harris-Kesten Theorem concerning bond percolation in the planar square…

We study the $m=3$ bootstrap percolation model on a cubic lattice, using Monte Carlo simulation and finite-size scaling techniques. In bootstrap percolation, sites on a lattice are considered occupied (present) or vacant (absent) with…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster is asymptotically equal to $\pi…

Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

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…

The statistical properties of spectra of a three-dimensional quantum bond percolation system is studied in the vicinity of the metal insulator transition. In order to avoid the influence of small clusters, only regions of the spectra in…