Related papers: On cable-graph percolation between dimensions 2 an…
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…
We study percolative properties of excursion processes and the discrete Gaussian free field (dGFF) in the planar unit disk. We consider discrete excursion clouds, defined using random walks as a two-dimensional version of random…
This paper studies growth, percolation, and correlations in disordered fiber networks. We start by introducing a 2D continuum deposition model with effective fiber-fiber interactions represented by a parameter $p$ which controls the degree…
We consider level-set percolation for the Gaussian membrane model on $\mathbb{Z}^d$, with $d \geq 5$, and establish that as $h \in \mathbb{R}$ varies, a non-trivial percolation phase transition for the level-set above level $h$ occurs at…
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show a critical percolation transition when a fraction of edges…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…
We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…
The fractal structure of directed percolation clusters, grown at the percolation threshold inside parabolic-like systems, is studied in two dimensions via Monte Carlo simulations. With a free surface at y=\pm Cx^k and a dynamical exponent…
Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…
The high-density plaquette percolation model in d dimensions contains a surface that is homeomorphic to the (d-1)-sphere and encloses the origin. This is proved by a path-counting argument in a dual model. When d=3, this permits an improved…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
Consider the indicator function $f$ of a two-dimensional percolation crossing event. In this paper, the Fourier transform of $f$ is studied and sharp bounds are obtained for its lower tail in several situations. Various applications of…
We provide a complete proof of the diagrammatic bounds on the lace-expansion coefficients for oriented percolation, which are used in [arXiv:math/0703455] to investigate critical behavior for long-range oriented percolation above…
We consider the density of two-dimensional critical percolation clusters, constrained to touch one or both boundaries, in infinite strips, half-infinite strips, and squares, as well as several related quantities for the infinite strip. Our…
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…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
In this paper we study bond percolation on a one-dimensional chain with power-law bond probability $C/ r^{1+\sigma}$, where $r$ is the distance length between distinct sites. We introduce and test an order $N$ Monte Carlo algorithm and we…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…