中文
相关论文

相关论文: Removing Malicious Nodes from Networks

200 篇论文

Controlling a complex network is of great importance in many applications. The network can be controlled by inputting external control signals through some selected nodes, which are called input nodes. Previous works found that the majority…

社会与信息网络 · 计算机科学 2019-10-23 Xizhe Zhang , Qian Li

Identifying and removing spurious links in complex networks is a meaningful problem for many real applications and is crucial for improving the reliability of network data, which in turn can lead to a better understanding of the highly…

物理与社会 · 物理学 2015-05-30 An Zeng , Giulio Cimini

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…

物理与社会 · 物理学 2015-06-12 F. Molnar , N. Derzsy , B. K. Szymanski , G. Korniss

Training neural networks involves solving large-scale non-convex optimization problems. This task has long been believed to be extremely difficult, with fear of local minima and other obstacles motivating a variety of schemes to improve…

神经与进化计算 · 计算机科学 2015-05-25 Ian J. Goodfellow , Oriol Vinyals , Andrew M. Saxe

In this work, we consider two types of adversarial attacks on a network of nodes seeking to reach consensus. The first type involves an adversary that is capable of breaking a specific number of links at each time instant. In the second…

最优化与控制 · 数学 2013-03-12 Ali Khanafer , Behrouz Touri , Tamer Başar

The advent of online social networks has facilitated fast and wide spread of information. However, some users, especially members of minority groups, may be less likely to receive information spreading on the network, due to their…

社会与信息网络 · 计算机科学 2025-12-18 Changan Liu , Xiaotian Zhou , Ahad N. Zehmakan , Zhongzhi Zhang

Network interdiction problems are combinatorial optimization problems involving two players: one aims to solve an optimization problem on a network, while the other seeks to modify the network to thwart the first player's objectives. Such…

人工智能 · 计算机科学 2026-04-21 Lei Zhang , Zhiqian Chen , Chang-Tien Lu , Liang Zhao

The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the largest disruption? More formally, given a graph, which…

数据结构与算法 · 计算机科学 2022-02-17 Max Ward , Amitava Datta , Hung X. Nguyen , Jason Eshraghian

The control of complex networks is of paramount importance in areas as diverse as ecosystem management, emergency response, and cell reprogramming. A fundamental property of networks is that perturbations to one node can affect other nodes,…

无序系统与神经网络 · 物理学 2013-07-15 Sean P. Cornelius , William L. Kath , Adilson E. Motter

While social networks are widely used as a media for information diffusion, attackers can also strategically employ analytical tools, such as influence maximization, to maximize the spread of adversarial content through the networks. We…

社会与信息网络 · 计算机科学 2020-11-04 Feiran Jia , Kai Zhou , Charles Kamhoua , Yevgeniy Vorobeychik

We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in…

社会与信息网络 · 计算机科学 2012-03-29 Haotian Zhang , Shreyas Sundaram

We address the problem of selecting $k$ representative nodes from a network, aiming to achieve two objectives: identifying the most influential nodes and ensuring the selection proportionally reflects the network's diversity. We propose two…

计算机科学与博弈论 · 计算机科学 2026-05-21 Georgios Papasotiropoulos , Oskar Skibski , Piotr Skowron , Tomasz Wąs

Spreading of either information or matter can often be treated as a network problem. It can be of great importance to be able to estimate the likelihood that spreading through a network reaches essentially the entire network while still not…

无序系统与神经网络 · 物理学 2009-03-09 Tomas Alarcon , Henrik Jeldtoft Jensen

In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. With a greedy algorithm, they found the optimal structure with respect to this…

物理与社会 · 物理学 2012-06-28 An Zeng , Weiping Liu

Can we employ one neural model to efficiently dismantle many complex yet unique networks? This article provides an affirmative answer. Diverse real-world systems can be abstracted as complex networks each consisting of many functional nodes…

社会与信息网络 · 计算机科学 2022-08-17 Jiazheng Zhang , Bang Wang

Critical nodes in networks are extremely vulnerable to malicious attacks to trigger negative cascading events such as the spread of misinformation and diseases. Therefore, effective moderation of critical nodes is very vital for mitigating…

社会与信息网络 · 计算机科学 2023-09-13 Changan Liu , Xiaotian Zhou , Ahad N. Zehmakan , Zhongzhi Zhang

In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from practical points of view. In this contribution we present a module-based method to…

物理与社会 · 物理学 2019-10-02 Bruno Requião da Cunha , Juan Carlos González-Avella , Sebastián Gonçalves

In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal.…

社会与信息网络 · 计算机科学 2017-02-07 Hung T. Nguyen , Nam P. Nguyen , Tam Vu , Huan X. Hoang , Thang N. Dinh

Graphs are pervasive in our everyday lives, with relevance to biology, the internet, and infrastructure, as well as numerous other applications. It is thus necessary to have an understanding as to how quickly a graph disintegrates, whether…

社会与信息网络 · 计算机科学 2025-12-25 Jeremie Fish , Mahesh Banavar , Erik Bollt

Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probability of existence. In this paper, we investigate the novel and…

数据库 · 计算机科学 2020-05-26 Xiangyu Ke , Arijit Khan , Mohammad Al Hasan , Rojin Rezvansangsari