Related papers: Testing the Connectivity of Networks
Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to…
We study a material modeled as a network of nodes connected by edges. Using a discrete approach, we build a nonlinear algebraic system that connects applied forces to internal forces and node positions. The model can describe elasticity,…
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…
We investigate exponential families of random graph distributions as a framework for systematic quantification of structure in networks. In this paper we restrict ourselves to undirected unlabeled graphs. For these graphs, the counts of…
We consider the distributed optimization problem, where a group of agents work together to optimize a common objective by communicating with neighboring agents and performing local computations. For a given algorithm, we use tools from…
Random networks are increasingly used to analyse complex transportation networks, such as airline routes, roads and rail networks. So far, this research has been focused on describing the properties of the networks with the help of random…
A model for growing networks is introduced, having as a main ingredient that new nodes are attached to the network through one existing node and then explore the network through the links of the visited nodes. From exact calculations of two…
A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes…
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since the method detects efficiently clustered nodes in large…
This article offers a brief overview of the current research topics concerning strategies to mitigate the adverse effects of perturbations in complex networks. It addresses the issue of an unclear use of Robustness and Resilience…
Large real-life complex networks are often modeled by various random graph constructions and hundreds of further references therein. In many cases it is not at all clear how the modeling strength of differently generated random graph model…
Much of our commerce and traveling depend on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after…
Networks are useful descriptions of the structure of many complex systems. Unsurprisingly, it is thus important to analyze the robustness of networks in many scientific disciplines. In applications in communication, logistics, finance,…
Given a connected network, it can be augmented by applying a growing strategy (e.g. random or scale-free rules) over the previously existing structure. Another approach for augmentation, recently introduced, involves incorporating a direct…
We consider a multi-layer network with two layers, $\mathcal{L}_{1}$, $\mathcal{L}_{2}$. Their intra-layer topology shows a scale-free degree distribution and a core-periphery structure. A nested structure describes the inter-layer…
Critical infrastructure networks are a key ingredient of modern society. We discuss a general method to spot the critical components of a critical infrastructure network, i.e. the nodes and the links fundamental to the perfect functioning…
Network robustness is an essential system property to sustain functionality in the face of failures or targeted attacks. Currently, only the connectivity of the nodes unaffected by an attack is utilized to assess robustness. We propose to…
Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening,…
In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known.…
Reliability is one of the important measures of how well the system meets its design objective, and mathematically is the probability that a system will perform satisfactorily for at least a given period of time. When the system is…