Related papers: On the threshold for triangulations inside convex …
We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…
We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…
We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…
The number of two-dimensional percolation clusters whose external hulls enclose an area greater than A, in a system of area Omega, behaves at the critical point as C \Omega /A for large A, where C = 1/(8 pi sqrt(3)). Here we show that away…
The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…
Let $p_c(\mathbb{Q}_n)$ and $p_c(\mathbb{Z}^n)$ denote the critical values for nearest-neighbour bond percolation on the $n$-cube $\mathbb{Q}_n = \{0,1\}^n$ and on $\Z^n$, respectively. Let $\Omega = n$ for $\mathbb{G} = \mathbb{Q}_n$ and…
The following article deals with the critical value p_c of the three-dimensional bootstrap percolation. We will check the behavior of p_c for different lengths of the lattice and additionally we will scale p_c in the limit of an infinite…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
It is known that random convex polygonal lines on $\mathbb{Z}_+^2$ (with the endpoints fixed at $0=(0,0)$ and $n=(n_1,n_2)\to\infty$) have a limit shape with respect to the uniform probability measure, identified as the parabola arc…
An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…
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…
Consider nearest-neighbor oriented percolation in $d+1$ space-time dimensions. Let $\rho,\eta,\nu$ be the critical exponents for the survival probability up to time $t$, the expected number of vertices at time $t$ connected from the…
We consider the functional given by the product of the first Dirichlet eigenvalue and the torsional rigidity of planar domains normalized by the area. This scale invariant functional was studied by P\'olya and Szeg\H{o} in 1951 who showed…
We give a characterization of the percolation threshold for a multirange model on oriented trees, as the first positive root of a polynomial, with the use of a multi-type Galton-Watson process. This gives in particular the exact value of…
In this work we consider the two-dimensional percolation model arising from the majority dynamics process at a given time $t\in\mathbb{R}_+$. We show the emergence of a sharp threshold phenomenon for the box crossing event at the critical…
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…
We study the possible scaling limits of percolation interfaces in two dimensions on the triangular lattice. When one lets the percolation parameter p(N) vary with the size N of the box that one is considering, three possibilities arise in…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
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…
We study site percolation on Angel & Schramm's uniform infinite planar triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes…