相关论文: Sharp thresholds and percolation in the plane

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…

In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…

We obtain the exact solution of the bond-percolation thresholds with inhomogenous probabilities on the square lattice. Our method is based on the duality analysis with real-space renormalization, which is a profound technique invented in…

We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity…

In this paper we study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex becomes active if at least…

Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…

We consider full scaling limits of planar nearcritical percolation in the Quad-Crossing-Topology introduced by Schramm and Smirnov. We show that two nearcritical scaling limits with different parameters are singular with respect to each…

I present a concise review of advances realized over the past three years on planar Poisson-Voronoi tessellations. These encompass new analytic results, a new Monte Carlo method, and application to experimental data.

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…

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…

We derive three critical exponents for Bernoulli site percolation on the on the Uniform Infinite Planar Triangulation (UIPT). First we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the…

In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.

We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…

We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…

We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie lattice with five different probabilities, a problem that does not appear at first to fall into any known solvable class. Although our…

Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…

We provide a new proof of the near-critical scaling relation $\beta=\xi_1\nu$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather…

Bogomolny and Schmit proposed that the critical edge percolation on the square lattice is a good model for the nodal domains of a random plane wave. Based on this they made a conjecture about the number of nodal domains. Recent computer…

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…