A Framework of Hierarchical Attacks to Network Controllability

Yang Lou, Lin Wang, Guanrong Chen

备注：: 10 pages,10 figures
发表信息：: Communications in Nonlinear Science and Numerical Simulation, 98:105780, 2021
DOI：: 10.1016/j.cnsns.2021.105780

英文摘要：

Network controllability robustness reflects how well a networked dynamical system can maintain its controllability against destructive attacks. This paper investigates the network controllability robustness from the perspective of a malicious attack. A framework of hierarchical attack is proposed, by means of edge- or node-removal attacks. Edges (or nodes) in a target network are classified hierarchically into categories, with different priorities to attack. The category of critical edges (or nodes) has the highest priority to be selected for attack. Extensive experiments on nine synthetic networks and nine real-world networks show the effectiveness of the proposed hierarchical attack strategies for destructing the network controllability. From the protection point of view, this study suggests that the critical edges and nodes should be hidden from the attackers. This finding helps better understand the network controllability and better design robust networks.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Knowledge-Based Prediction of Network Controllability Robustness

Network controllability robustness reflects how well a networked system can maintain its controllability against destructive attacks. Its measure is quantified by a sequence of values that record the remaining controllability of the network after a sequence of node-removal or edge-removal attacks. Traditionally, the controllability robustness is determined by attack simulations, which is computationally time consuming or even infeasible. In the present paper, an improved method for predicting the network controllability robustness is developed based on machine learning using a group of convolu…

2021-04-23cs.SYeess.SYmath.OC

Control centrality and hierarchical structure in complex networks

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network's degree distribution. We rigorously prove that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general dire…

2012-03-12cond-mat.stat-mechcs.SIphysics.soc-ph

用于 $K$-core 攻击问题的分层环-树装填模型

Hierarchical cycle-tree packing model for $K$-core attack problem

针对最优 $K$-core 攻击问题，提出分层环-树装填模型与 hCTGA 算法，借助复本对称空腔方法和粗粒化置信传播，在随机图上构造近优攻击解。

2023-12-09cond-mat.dis-nncond-mat.stat-mechcs.CY

Hierarchical scale-free network is fragile against random failure

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 percolating phase when the occupation probability is less than 1. The present result is contrasted to bond percolation in the same network of which the percolation threshold is zero. We also show that the percolation threshold of intentional attacks is 1. Our results suggest that this hierarchical scale-free network is very fragile against both random failure and i…

2013-12-09cond-mat.dis-nnphysics.soc-ph

Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks

We study the vulnerability of dominating sets against random and targeted node removals in complex networks. While small, cost-efficient dominating sets play a significant role in controllability and observability of these networks, a fixed and intact network structure is always implicitly assumed. We find that cost-efficiency of dominating sets optimized for small size alone comes at a price of being vulnerable to damage; domination in the remaining network can be severely disrupted, even if a small fraction of dominator nodes are lost. We develop two new methods for finding flexible dominati…

2014-09-27cond-mat.stat-mechcs.SIphysics.soc-ph

Graph Hierarchy: A novel approach to understanding hierarchical structures in complex networks

Trophic coherence, a measure of a graph's hierarchical organisation, has been shown to be linked to a graph's structural and dynamical aspects such as cyclicity, stability and normality. Trophic levels of vertices can reveal their functional properties and partition and rank the vertices accordingly. Yet trophic levels and hence trophic coherence can only be defined on graphs with basal vertices, vertices with zero in-degree. Consequently, trophic analysis of graphs had been restricted until now. In this paper we introduce a novel framework, a generalisation of trophic levels, which we call hi…

2020-10-07math.COphysics.soc-ph

更多相关论文收起更多论文

Underestimated cost of targeted attacks on complex networks

ETH Zürich（苏黎世联邦理工学院）；Rudjer Bošković Institute（鲁杰尔·博什科维奇研究所）

The robustness of complex networks under targeted attacks is deeply connected to the resilience of complex systems, i.e., the ability to make appropriate responses to the attacks. In this article, we investigated the state-of-the-art targeted node attack algorithms and demonstrate that they become very inefficient when the cost of the attack is taken into consideration. In this paper, we made explicit assumption that the cost of removing a node is proportional to the number of adjacent links that are removed, i.e., higher degree nodes have higher cost. Finally, for the case when it is possible…

2017-10-10cs.LGcs.SIphysics.soc-ph

Percolation of Hierarchical Networks and Networks of Networks

Much work has been devoted to studying percolation of networks and interdependent networks under varying levels of failures. Researchers have considered many different realistic network structures, but thus far no study has incorporated the hierarchical structure of many networks. For example, infrastructure across cities will likely be distributed such that nodes are tightly connected within small neighborhoods, somewhat less connected across the whole city, and have even fewer connections between cities. Furthermore, while previous work identified interconnected nodes, those nodes with links…

2018-05-03physics.soc-ph

Multiplex congruence network of natural numbers

Congruence theory has many applications in physical, social, biological and technological systems. Congruence arithmetic has been a fundamental tool for data security and computer algebra. However, much less attention was devoted to the topological features of congruence relations among natural numbers. Here, we explore the congruence relations in the setting of a multiplex network and unveil some unique and outstanding properties of the multiplex congruence network. Analytical results show that every layer therein is a sparse and heterogeneous subnetwork with a scale-free topology. Counterint…

2016-03-18cs.SImath.NTphysics.soc-ph