Related papers: Monochromatic path crossing exponents and graph co…
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…
We argue the exact universal result for the three-point connectivity of critical percolation in two dimensions. Predictions for Potts clusters and for the scaling limit below p_c are also given.
Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph, and use it to develop a continuum perturbation expansion for the MST on…
The percolation behavior of aligned rigid rods of length $k$ ($k$-mers) on two-dimensional triangular lattices has been studied by numerical simulations and finite-size scaling analysis. The $k$-mers, containing $k$ identical units (each…
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…
Let N^{+}(k)= 2^{k/2} k^{3/2} f(k) and N^{-}(k)= 2^{k/2} k^{1/2} g(k) where 1=o(f(k)) and g(k)=o(1). We show that the probability of a random 2-coloring of {1,2,...,N^{+}(k)} containing a monochromatic k-term arithmetic progression…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…
We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
Using Monte Carlo simulations we study the distributions of the 3-block mass $N_3$ in 4d, 5d, and 6d percolation systems. Because the probability of creating large 3-blocks in these dimensions is very small, we use a ``go with the winners''…
Polymer's network is treated as an anisotropic fractal with fractional dimensionality D = 1 + \epsilon close to one. Percolation model on such a fractal is studied. Using the real space renormalization group approach of Migdal and Kadanoff…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
A macroscopic characterization of fractals showing up a structural transition from dense to multibranched growth is made using optical diffraction theory. Such fractals are generated via the numerical solution of the 2D Poisson and…
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…
In two dimensions, the average electrical conductance from a point in a percolating network to the network boundary should be related by a conformal transformation to the conductance from one point to another in an unbounded network. We…
We study long-range power-law correlated disorder on square and cubic lattices. In particular, we present high-precision results for the percolation thresholds and the fractal dimension of the largest clusters as function of the correlation…