Related papers: Ordinary Percolation with Discontinuous Transition…
We consider two-dimensional percolation in the scaling limit close to criticality and use integrable field theory to obtain universal predictions for the probability that at least one cluster crosses between opposite sides of a rectangle of…
This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…
By introducing a simple competition mechanism for bond insertion in random graphs, explosive percolation exhibits a sharp phase transition with rich critical phenomena. We investigate high-order connectivity in explosive percolation using…
Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law decays of the distribution of cluster sizes in the…
We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…
We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…
The average number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all starting from the same origin in a disordered fractal is considered. This quantity $S_N(t)$ is the result of a double average: an…
Geometric representations provide a useful perspective on critical phenomena in the Ising model. In a recent study [Phys. Rev. E 112, 034118 (2025)], we found that the two-dimensional critical Ising model exhibits two consecutive…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous…
The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…
The theoretical basis of continuum percolation has changed greatly since its beginning as little more than an analogy with lattice systems. Nevertheless, there is yet no comprehensive theory of this field. A basis for such a theory is…
Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
This is a survey paper about the fractal percolation process, also known as Mandelbrot percolation. It is intended to give a general breadth overview of more recent research in the topic, but also includes some of the more classical…
Recently, a hybrid percolation transitions (HPT) that exhibits both a discontinuous transition and critical behavior at the same transition point has been observed in diverse complex systems. In spite of considerable effort to develop the…
We introduce the notion of topological electronic states on random lattices in non-integer dimensions. By considering a class $D$ model on critical percolation clusters embedded in two dimensions, we demonstrate that these topological…
Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of $g$ fraction of the entire population in the smallest clusters. Here we show…
We study rigidity percolation transitions in two-dimensional central-force isostatic lattices, including the square and the kagome lattices, as next-nearest-neighbor bonds ("braces") are randomly added to the system. In particular, we focus…
We study the percolation transition of the geometrical clusters in the square lattice LCCC model (a kinetic opinion exchange model introduced by Lallouache et al. in Phys. Rev. E 82 056112 (2010)) with the change in conviction and…