Related papers: How to efficiently destroy a network with limited …

Disinformation continues to attract attention due to its increasing threat to society. Nevertheless, a disinformation-based attack on critical infrastructure has never been studied to date. Here, we consider traffic networks and focus on…

Networks are beneficial to those being connected but can also be used as carriers of contagious hostile attacks. These attacks are often facilitated by exploiting corrupt network users. To protect against the attacks, users can resort to…

We study the response of complex networks subject to attacks on vertices and edges. Several existing complex network models as well as real-world networks of scientific collaborations and Internet traffic are numerically investigated, and…

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate…

It has recently become established that the spread of infectious diseases between humans is affected not only by the pathogen itself but also by changes in behavior as the population becomes aware of the epidemic; for example, social…

An efficient strategy for the identification of influential spreaders that could be used to control epidemics within populations would be of considerable importance. Generally, populations are characterized by its community structures and…

Methods to solve a node discovery problem for a social network are presented. Covert nodes refer to the nodes which are not observable directly. They transmit the influence and affect the resulting collaborative activities among the persons…

In this paper we consider an extension of the well-known Influence Maximization Problem in a social network which deals with finding a set of k nodes to initiate a diffusion process so that the total number of influenced nodes at the end of…

Recent years have seen a marked increase in the spread of misinformation, a phenomenon which has been accelerated and amplified by social media such as Facebook and Twitter. While some actors spread misinformation to push a specific agenda,…

Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that can manipulate the graph structure could alter traffic…

We explore a simple mathematical model of network computation, based on Markov chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social…

We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an…

Determining an appropriate number of features for each layer in a neural network is an important and difficult task. This task is especially important in applications on systems with limited memory or processing power. Many current…

Given a network, the critical node detection problem finds a subset of nodes whose removal disrupts the network connectivity. Since many real-world systems are naturally modeled as graphs, assessing the vulnerability of the network is…

In this study, an efficient method to immunize modular networks (i.e., networks with community structure) is proposed. The immunization of networks aims at fragmenting networks into small parts with a small number of removed nodes. Its…

We study the statistical properties of large random networks with specified degree distributions. New techniques are presented for analyzing the structure of social networks. Specifically, we address the question of how many nodes exist at…

We introduce a model involving two adversaries Buster and Fixer taking turns modifying a connected graph, where each round consists of Buster deleting a subset of edges and Fixer responding by adding edges from a finite reserve set of…

A significant problem in analysis of complex network is to reveal community structure, in which network nodes are tightly connected in the same communities, between which there are sparse connections. Previous algorithms for community…

To rank nodes in quasi-hierarchical networks of social nature, it is necessary to carry out a detailed analysis of the network and evaluate the results obtained according to all the given criteria and identify the most influential nodes.…

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.…