Related papers: Optimal cost for strengthening or destroying a giv…
We study cascading failures in smart grids, where an attacker selectively compromises the nodes with probabilities proportional to their degrees, betweenness, or clustering coefficient. This implies that nodes with high degrees,…
Cascading failures represent a fundamental threat to the integrity of complex systems, often precipitating a comprehensive collapse across diverse infrastructures and financial networks. This research articulates a robust and pragmatic…
Interdependencies are ubiquitous throughout the world. Every real-world system interacts with and is dependent on other systems, and this interdependency affects their performance. In particular, interdependencies among networks make them…
We study a problem of failure of two interdependent networks in the case of correlated degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes $N$ connected by the bidirectional dependency…
Centrality metrics have been widely applied to identify the nodes in a graph whose removal is effective in decomposing the graph into smaller sub-components. The node--removal process is generally used to test network robustness against…
We consider a distribution network for delivering a natural resource or physical good to a set of nodes, each of which serves a set of customers, in which disruptions may occur at one or more nodes. Each node receives flow through a path…
We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…
We study how to sparsify connectivity in graphs under a tight deletion budget. Given a graph $G$ and integers $k,x \ge 0$, Critical Node Cut (CNC) asks whether we can delete at most $k$ vertices so that the number of remaining unordered…
Many real infrastructure networks, such as power grids and communication networks, are not only depend on one another to function, but also embedded in space. A lot of works have been devoted to reveal the vulnerability of interdependent…
Network science have constantly been in the focus of research for the last decade, with considerable advances in the controllability of their structural. However, much less effort has been devoted to study that how to improve the…
Finding a set of nodes in a network, whose removal fragments the network below some target size at minimal cost is called network dismantling problem and it belongs to the NP-hard computational class. In this paper, we explore the…
Interdependent networks are characterized by two kinds of interactions: The usual connectivity links within each network and the dependency links coupling nodes of different networks. Due to the latter links such networks are known to…
The existence of inter-dependence between multiple networks imparts an additional scale of complexity to such systems often referred to as `network of networks' (NON). We have investigated the robustness of NONs to random breakdown of their…
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
We use the configuration model to generate networks having a degree distribution that follows a $q$-exponential, $P_q(k)=(2-q)\lambda[1-(1-q)\lambda k]^{1/(q-1)}$, for arbitrary values of the parameters $q$ and $\lambda$. We study the…
In this paper, we present algorithms for designing networks that are robust to node failures with minimal or limited number of links. We present algorithms for both the static network setting and the dynamic network setting; setting where…
In many cases of attacks or failures, memory effects play a significant role. Therefore, we present a model that not only considers the dependencies between nodes but also incorporates the memory effects of attacks. Our research…
A fundamental challenge in networked systems is detection and removal of suspected malicious nodes. In reality, detection is always imperfect, and the decision about which potentially malicious nodes to remove must trade off false positives…
Finding the important nodes in complex networks by topological structure is of great significance to network invulnerability. Several centrality measures have been proposed recently to evaluate the performance of nodes based on their…
To find out the role of the wiring cost in the organization of the neural network of the nematode \textit{Caenorhapditis elegans} (\textit{C. elegans}), we build the neuronal map of \textit{C. elegans} based on geometrical positions of…