Related papers: Topological estimation of percolation thresholds
We further study the interfaces arising in a situation of inhomogeneity. More precisely, we identify a characteristic length for the gradient percolation model, that enables us to tighten previous estimates established for it. This allows…
In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…
We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
In the presented article, statistical properties regarding the topology and standard percolation on relative neighborhood graphs (RNGs) for planar sets of points, considering the Euclidean metric, are put under scrutiny. RNGs belong to the…
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…
We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $\lambda>0$. Upon variation of $\lambda$ there is a…
We study the permeability of quasi two-dimensional porous structures of randomly placed overlapping monodisperse circular and elliptical grains. Measurements in microfluidic devices and lattice Boltzmann simulations demonstrate that the…
We study a percolation model on the square lattice, where clusters "freeze" (stop growing) as soon as their volume (i.e. the number of sites they contain) gets larger than N, the parameter of the model. A model where clusters freeze when…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then…
We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…
We consider the growth of clusters in disordered media at zero temperature, as exemplified by supercritical generalized percolation and by the random field Ising model. We show that the morphology of such clusters and of their surfaces can…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…
The 't Hooft criterion leading to confinement out of a percolating cluster of central vortices suggests defining a novel three-dimensional gauge theory directly on a random percolation process. Wilson loop is viewed as a counter of…
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…
Nanofiller particles, such as carbon nanotubes or metal wires, are used in functional polymer composites to make them conduct electricity. They are often not perfectly straight cylinders, but may be tortuous or exhibit kinks. Therefore we…
We present a study of connectivity percolation in suspensions of hard spherocylinders by means of Monte Carlo simulation and connectedness percolation theory. We focus attention on polydispersity in the length, the diameter and the…
We present a new approach to study measures on ensembles of contours, polymers or other objects interacting by some sort of exclusion condition. For concreteness we develop it here for the case of Peierls contours. Unlike existing methods,…