Related papers: The Number of Open Paths in Oriented Percolation
We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\mathbb{Z}^{d},\,d\geq2$ in the limit where their distances tend to infinity.
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
The chemical distance D(x,y) is the length of the shortest open path between two points x and y in an infinite Bernoulli percolation cluster. In this work, we study the asymptotic behaviour of this random metric, and we prove that, for an…
We consider directed first-passage and last-passage percolation on the nonnegative lattice Z_+^d, d\geq2, with i.i.d. weights at the vertices. Under certain moment conditions on the common distribution of the weights, the limits…
A $(1+1)$ dimensional model of directed percolation is introduced where sites on a tilted square lattice are connected to their neighbours by $N$ channels, operated at both ends by valves which are either open or closed. The spreading fluid…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
Inspired by biological evolution, we consider the following so-called accessibility percolation problem: The vertices of the unoriented $n$-dimensional binary hypercube are assigned independent $U(0, 1)$ weights, referred to as fitnesses. A…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and…
Given invariant percolation on a regular tree, where the probability of an edge to be open equals $p$, is it always possible to find an infinite self-avoiding path along which the density of open edges is bigger then $p$?
We show that the diameter of the directed configuration model with $n$ vertices rescaled by $\log n$ converges in probability to a constant. Our assumptions are the convergence of the in- and out-degree of a uniform random vertex in…
We obtain new lower bounds on the critical points for various models of oriented percolation. The method is to provide a stochastic domination of the percolation processes by multitype Galton-Watson trees. This can be apply to the classical…
We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…
Recent work on percolation in $d=2$ [J. Phys. A {\bf 55} 204002] introduced an operator that gives a weight $k^{\ell}$ to configurations with $\ell$ `nested paths' (NP), i.e. disjoint cycles surrounding the origin, if there exists a cluster…
We prove exact bounds on the time complexity of distributed graph colouring. If we are given a directed path that is properly coloured with $n$ colours, by prior work it is known that we can find a proper 3-colouring in $\frac{1}{2}…
We argue that clustering of color sources, leading to the percolation transition, may be the way to achieve deconfinement in heavy ion collisions. The critical density for percolation is related to the effective critical temperature of the…
We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…
In this paper we consider first passage percolation on the square lattice \(\mathbb{Z}^d\) with passage times that are independent and have bounded \(p^{th}\) moment for some \(p > 6(1+d),\) but not necessarily identically distributed. For…