Related papers: Widths of crossings in Poisson Boolean percolation

We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability…

Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…

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…

Bounds for the diameter and for the expansion of long-range percolation clusters on the cycle $\Z / N\Z$ are given.

We study how much water can be retained without leaking through boundaries when each unit square of a two-dimensional lattice is randomly assigned a block of unit bottom area but with different heights from zero to $n-1$. As more blocks are…

Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…

Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $\ell$ is a sequence $p_1, \dots, p_\ell$ of $\ell$ points from $P$…

Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…

We study bond percolation of $N$ non-interacting Gaussian polymers of $\ell$ segments on a 2D square lattice of size $L$ with reflecting boundaries. Through simulations, we find the fraction of configurations displaying {\em no} connected…

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed…

Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is…

We consider some continuum percolation models. We are mainly interested in giving some sufficient conditions for absence of percolation. We give some general conditions and then focuse on two examples. The first one is a multiscale…

Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…

We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

This is a study of percolation in the hyperbolic plane and on regular tilings in the hyperbolic plane. The processes discussed include Bernoulli site and bond percolation on planar hyperbolic graphs, invariant dependent percolations on such…

Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

2D Percolation path exponents $x^{\cal P}_{\ell}$ describe probabilities for traversals of annuli by $\ell$ non-overlapping paths, each on either occupied or vacant clusters, with at least one of each type. We relate the probabilities…