Related papers: Toward Stronger Robustness of Network Controllabil…

We study the robustness properties of multiplex networks consisting of multiple layers of distinct types of links, focusing on the role of correlations between degrees of a node in different layers. We use generating function formalism to…

We study a graph-theoretic property known as robustness, which plays a key role in certain classes of dynamics on networks (such as resilient consensus, contagion and bootstrap percolation). This property is stronger than other graph…

This paper studies the problem of controlling complex networks, that is, the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem (i) we propose a metric…

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers.…

Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…

Robustness is an important property of complex networks. Up to now, there are plentiful researches focusing on the network's robustness containing error and attack tolerance of network's connectivity and the shortest path. In this paper,…

This paper studies the observability radius of network systems, which measures the robustness of a network to perturbations of the edges. We consider linear networks, where the dynamics are described by a weighted adjacency matrix, and…

Network robustness is critical for various industrial and social networks against malicious attacks, which has various meanings in different research contexts and here it refers to the ability of a network to sustain its functionality when…

It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers.…

In this work, water distribution systems are regarded as large sparse planar graphs with complex network characteristics and the relationship between important topological features of the network (i.e. structural robustness and loop…

Complex systems are large collections of entities that organize themselves into non-trivial structures that can be represented by networks. A key emergent property of such systems is robustness against random failures or targeted attacks…

We present a comprehensive analysis on connectivity and resilience of secure sensor networks under the widely studied q-composite key predistribution scheme. For network connectivity which ensures that any two sensors can find a path in…

Scale-free networks with small power law exponent are known to be robust, meaning that their qualitative topological structure cannot be altered by random removal of even a large proportion of nodes. By contrast, it has been argued in the…

Dynamics in biological networks are in general robust against several perturbations. We investigate a coupled map network as a model motivated by gene regulatory networks and design systems which are robust against phenotypic perturbations…

In the past few years, the discoveries of small-world and scale-free properties of many natural and artificial complex networks have stimulated significant advances in better understanding the relationship between the topology and the…

Network systems consist of subsystems and their interconnections, and provide a powerful framework for analysis, modeling and control of complex systems. However, subsystems may have high-dimensional dynamics, and the amount and nature of…

A crucial challenge in network theory is the study of the robustness of a network after facing a sequence of failures. In this work, we propose a dynamical definition of network's robustness based on Information Theory, that considers…

In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where the network topologies change by continuous removal and addition of nodes. Each removal and addition…

In this paper, controllability of undirected networked systems with {diffusively coupled subsystems} is considered, where each subsystem is of {identically {\emph{fixed}}} general high-order single-input-multi-output dynamics. The…

Network motifs are often called the building blocks of networks. Analysis of motifs is found to be an indispensable tool for understanding local network structure, in contrast to measures based on node degree distribution and its functions…