Related papers: Percolation of partially interdependent networks u…
We apply a variant of the explosive percolation procedure to large real-world networks, and show with finite-size scaling that the university class, ordinary or explosive, of the resulting percolation transition depends on the structural…
Many systems such as critical infrastructure exhibit a modular structure with many links within the modules and few links between them. One approach to increase the robustness of these systems is to reinforce a fraction of the nodes in each…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
Error tolerance and attack vulnerability are two common and important properties of complex networks, which are usually used to evaluate the robustness of a network. Recently, much work has been devoted to determining the network design…
We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted…
We model the robustness against random failure or intentional attack of networks with arbitrary large-scale structure. We construct a block-based model which incorporates --- in a general fashion --- both connectivity and interdependence…
Road networks are characterised by several structural and geometric properties. Their topological structure determines partially its hierarchical arrangement, but since these are networks that are spatially situated and, therefore,…
We discuss attacks and infections at propagating fronts of percolation processes based on the extended general epidemic process. The scaling behavior of the number of the attacked and infected sites in the long time limit at the ordinary…
This paper studies growth, percolation, and correlations in disordered fiber networks. We start by introducing a 2D continuum deposition model with effective fiber-fiber interactions represented by a parameter $p$ which controls the degree…
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum…
Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links…
Establishing long-distance quantum entanglement, i.e., entanglement transmission, in quantum networks (QN) is a key and timely challenge for developing efficient quantum communication. Traditional comprehension based on classical…
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…
Whether as telecommunications or power systems, networks are very important in everyday life. Maintaining these networks properly functional and connected, even under attacks or failures, is of special concern. This topic has been…
Many real-world systems can be modeled as interconnected multilayer networks, namely a set of networks interacting with each other. Here we present a perturbative approach to study the properties of a general class of interconnected…
Disordered fibrous networks are ubiquitous in nature as major structural components of living cells and tissues. The mechanical stability of networks generally depends on the degree of connectivity: only when the average number of…
The behaviour of complex networks under failure or attack depends strongly on the specific scenario. Of special interest are scale-free networks, which are usually seen as robust under random failure but appear to be especially vulnerable…
Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in…
Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in…
Interdependent networks are more fragile under random attacks than simplex networks, because interlayer dependencies lead to cascading failures and finally to a sudden collapse. This is a hybrid phase transition (HPT), meaning that at the…