Related papers: Nonmonotonic percolation threshold in correlated n…
Low-connectivity polymer networks were recently found to behave auxetically when subjected to small tensions, that is, their Poisson's ratio $\nu$ becomes negative. In addition, for specific state points, numerical simulations revealed that…
We investigate site percolation in a hierarchical scale-free network known as the Dorogovtsev- Goltsev-Mendes network. We use the generating function method to show that the percolation threshold is 1, i.e., the system is not in the…
Modeling how networks change under structural perturbations can yield foundational insights into network robustness, which is critical in many real-world applications. The largest connected component is a popular measure of network…
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…
The robustness of complex networks with dependencies has been studied in recent years. However, previous studies focused on the robustness of networks composed of dependency links without network topology. In this study, we will analyze the…
Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…
We investigate the impact of degree-degree correlations on the spectra of networks. Even though density distributions exhibit drastic changes depending on the (dis)assortative mixing and the network architecture, the short range…
Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. In this paper, based on a percolation theory and a geometric graph property,…
We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity…
The Pearson correlation coefficient is commonly used for quantifying the global level of degree-degree association in complex networks. Here, we use a probabilistic representation of the underlying network structure for assessing the…
Why are most empirical networks, with the prominent exception of social ones, generically degree-degree anticorrelated, i.e. disassortative? With a view to answering this long-standing question, we define a general class of degree-degree…
Real-world networks process structured connections since they have non-trivial vertex degree correlation and clustering. Here we propose a toy model of structure formation in real-world weighted network. In our model, a network evolves by…
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…
Deep learning models have been shown to be vulnerable to adversarial attacks. This perception led to analyzing deep learning models not only from the perspective of their performance measures but also their robustness to certain types of…
One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with non-dyadic, higher-order…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths…
In this paper, we study the robustness of network topologies. We use the concept of percolation as measuring tool to assess the reliability polynomial of those systems which can be modeled as a general inhomogeneous random graph as well as…
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…
A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…