Corpus ID: 221112088

Optimizing Graph Structure for Targeted Diffusion

  title={Optimizing Graph Structure for Targeted Diffusion},
  author={Sixie Yu and Leonardo A. B. T{\^o}rres and Scott Alfeld and Tina Eliassi-Rad and Yevgeniy Vorobeychik},
The problem of diffusion control on networks has been extensively studied, with applications ranging from marketing to controlling infectious disease. However, in many applications, such as cybersecurity, an attacker may want to attack a targeted subgraph of a network, while limiting the impact on the rest of the network in order to remain undetected. We present a model POTION in which the principal aim is to optimize graph structure to achieve such targeted attacks. We propose an algorithm… Expand


Automatic differentiation in pytorch, 2017
  • 2017
Epidemic thresholds in real networks
A general epidemic threshold condition is proposed for the NLDS system: it is proved that the epidemic threshold for a network is exactly the inverse of the largest eigenvalue of its adjacency matrix, and it is shown that below the epidemic thresholds, infections die out at an exponential rate. Expand
Virus Spread in Networks
The influence of the network characteristics on the virus spread is analyzed in a new-the <i>N</i> -intertwined Markov chain-model, whose only approximation lies in the application of mean fieldExpand
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
Inducing Equilibria in Networked Public Goods Games through Network Structure Modification
This work begins an algorithmic study of targeted network modifications with the goal of inducing equilibria of a particular form, and exhibits a broad array of scenarios in which the problem can be solved in polynomial time by non-trivial reductions to (minimum-cost) matching problems. Expand
Node Immunization with Non-backtracking Eigenvalues
This work develops techniques that identify which nodes have the largest impact on the leading non- backtracking eigenvalue by studying the behavior of the spectrum of the non-backtracking matrix after a node is removed from the graph. Expand
Spectra and Pseudospectra
Eigenvalues, latent roots, proper values, characteristic values—four synonyms for a set of numbers that provide much useful information about a matrix or operator. A huge amount of research has beenExpand
‘Hubs-repelling’ Laplacian and related diffusion on graphs/networks
Abstract We define and study here a graph unsymmetric Laplacian matrix that operates a diffusive process biased towards low-degree nodes. We prove that this matrix is positive semidefine with allExpand
Attacking Similarity-Based Link Prediction in Social Networks
This work offers a comprehensive algorithmic investigation of the problem of attacking similarity-based link prediction through link deletion, focusing on two broad classes of such approaches, one which uses only local information about target links, and another which uses global network information. Expand
Diffusion-dynamics laws in stochastic reaction networks.
Within the approximation of reaction-diffusion master equation (RDME), it is found general relation that the steady-state distribution in complex balanced networks is diffusion-independent, which implies that the stochastic dynamics of networks is unaffected by diffusion at any arbitrary time. Expand