Related papers: Tricritical point in heterogeneous k-core percolat…
Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size…
In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
The quantum tricriticality of d-dimensional transverse Ising-like systems is studied by means of a perturbative renormalization group approach focusing on static susceptibility. This allows us to obtain the phase diagram for 3<d<4, with a…
Core-periphery structure, the arrangement of a network into a dense core and sparse periphery, is a versatile descriptor of various social, biological, and technological networks. In practice, different core-periphery algorithms are often…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
Bootstrap, or $k$-core, percolation displays on the Bethe lattice a mixed first/second order phase transition with both a discontinuous order parameter and diverging critical fluctuations. I apply the recently introduced $M$-layer technique…
We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…
Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to…
Percolation is an emblematic model to assess the robustness of interconnected systems when some of their components are corrupted. It is usually investigated in simple scenarios, such as the removal of the system's units in random order, or…
To enhance robustness of complex networked systems, a simple method is introducing reinforced nodes which always function during failure propagation. A random scheme of node reinforcement can be considered as a benchmark for finding an…
Understanding how network structure constrains and enables information processing is a central problem in the statistical mechanics of interacting systems. Here we study random networks across the structural percolation transition and…
Three-dimensional quantum percolation problems are studied by analyzing energy level statistics of electrons on maximally connected percolating clusters. The quantum percolation threshold $\pq$, which is larger than the classical…
In this paper, robustness of planar trivalent random graphs to targeted attacks of highest connected nodes is investigated using numerical simulations. It is shown that these graphs are relatively robust. The nonrandom node removal process…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
We study percolation on self-dual hypergraphs that contain hyperedges with four bounding vertices, or "four-edges", using three different generators, each containing bonds or sites with three distinct probabilities $p$, $r$, and $t$…
The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years,…
Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…