Related papers: Heavy Bernoulli-percolation clusters are indisting…
We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…
We extend the notion of quasi-transitive orientations of graphs to 2-edge-coloured graphs. By relating quasi-transitive $2$-edge-colourings to an equivalence relation on the edge set of a graph, we classify those graphs that admit a…
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…
It was pointed out by de Arcangelis et al. [Europhys. Lett. 14 (1991), 515] that the correct understanding of the percolation phenomenon of the Fortuin-Kasteleyn cluster in the Edwards-Anderson model is important since a dynamical…
Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…
We investigate bond percolation on the non-planar Hanoi network (HN-NP), which was studied in [Boettcher et al. Phys. Rev. E 80 (2009) 041115]. We calculate the fractal exponent of a subgraph of the HN-NP, which gives a lower bound for the…
Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…
We introduce an exponential random graph model for networks with a fixed degree distribution and with a tunable degree-degree correlation. We then investigate the nature of a percolation transition in the correlated network with the Poisson…
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…
We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following bond percolation. We use our theoretical result to find the…
We prove that the connectivity of the level sets of a wide class of smooth centred planar Gaussian fields exhibits a phase transition at the zero level that is analogous to the phase transition in Bernoulli percolation. In addition to…
We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…
We introduce a novel percolation model that generalizes the classical Random Connection Model (RCM) to a random simplicial complex, allowing for a more refined understanding of connectivity and emergence of large-scale structures in random…
In this paper we show the existence of a sharp threshold for the appearance of a giant component after percolation of Cartesian products of graphs under assumptions on their maximum degrees and their isoperimetric constants. In particular,…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…