Related papers: When not to target negative ties? Studying competi…
We study the interaction between a network designer and an adversary over a dynamical network. The network consists of nodes performing continuous-time distributed averaging. The adversary strategically disconnects a set of links to prevent…
In this paper, we investigate the discount allocation problem in social networks. It has been reported that 40\% of consumers will share an email offer with their friend and 28\% of consumers will share deals via social media platforms.…
We consider the problem of identifying the most influential nodes for a spreading process on a network when prior knowledge about structure and dynamics of the system is incomplete or erroneous. Specifically, we perform a numerical analysis…
Networks are ubiquitous throughout science and engineering. A number of methods, including some from our own group, have explored how one goes about computing or predicting the dynamics of networks given information about internal models of…
We study the problem of election control through social influence when the manipulator is allowed to use the locations that she acquired on the network for sending \emph{both} positive and negative messages on \emph{multiple} candidates,…
In a Stackelberg network pricing game, a leader sets prices for a given subset of edges so as to maximize profit, after which one or multiple followers choose a shortest path from their source to sink. We study the counter-intuitive…
This paper investigates the vulnerability of urban traffic networks to cyber-attacks on traffic lights. We model traffic signal tampering as a bi-objective optimization problem that simultaneously seeks to reduce vehicular throughput in the…
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,…
We analyse signed networks from the perspective of balance theory which predicts structural balance as a global structure for signed social networks that represent groups of friends and enemies. The scarcity of balanced networks encouraged…
This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing…
Election control considers the problem of an adversary who attempts to tamper with a voting process, in order to either ensure that their favored candidate wins (constructive control) or another candidate loses (destructive control). As…
Most studies of disease spreading consider the underlying social network as obtained without the contagion, though epidemic influences people's willingness to contact others: A "friendly" contact may be turned to "unfriendly" to avoid…
A widely studied process of influence diffusion in social networks posits that the dynamics of influence diffusion evolves as follows: Given a graph $G=(V,E)$, representing the network, initially \emph{only} the members of a given…
We study a competition dynamics, based on the minority game, endowed with various substrate network structures. We observe the effects of the network topologies by investigating the volatility of the system and the structure of follower…
The spread of influence in networks is a topic of great importance in many application areas. For instance, one would like to maximise the coverage, limiting the budget for marketing campaign initialisation and use the potential of social…
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree…
We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominating set problem in weighted networks. Applications of this problem in weighted settings include finding: a…
Background: Controlling global epidemics in the real world and accelerating information propagation in the artificial world are of great significance, which have activated an upsurge in the studies on networked spreading dynamics. Lots of…
Pinning control of a complex network aims at forcing the states of all nodes to track an external signal by controlling a small number of nodes in the network. In this paper, an algebraic graph-theoretic condition is introduced to optimize…
Competitive interactions represent one of the driving forces behind evolution and natural selection in biological and sociological systems. For example, animals in an ecosystem may vie for food or mates; in a market economy, firms may…