The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Dynamic monopolies of constant size
Journal of Combinatorial Theory Series B
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences - Special issue on STOC 2000
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Natural communities in large linked networks
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Information diffusion through blogspace
Proceedings of the 13th international conference on World Wide Web
Complexity - Understanding Complex Systems: Part II
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
The dynamics of viral marketing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
On the submodularity of influence in social networks
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling: An International Journal
On local search for the generalized graph coloring problem
Operations Research Letters
SNAKDD 2008 social network mining and analysis postworkshop report
ACM SIGKDD Explorations Newsletter
Finding critical nodes for inhibiting diffusion of complex contagions in social networks
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Maximizing influence spread in modular social networks by optimal resource allocation
Expert Systems with Applications: An International Journal
Role-dynamics: fast mining of large dynamic networks
Proceedings of the 21st international conference companion on World Wide Web
Controlling opinion bias in online social networks
Proceedings of the 3rd Annual ACM Web Science Conference
Proceedings of the 21st ACM international conference on Information and knowledge management
Interaction-based HPC modeling of social, biological, and economic contagions over large networks
Proceedings of the Winter Simulation Conference
Modeling dynamic behavior in large evolving graphs
Proceedings of the sixth ACM international conference on Web search and data mining
Community evolution detection in time-evolving information networks
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Understanding evolving group structures in time-varying networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Controlling opinion propagation in online networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 17th International Database Engineering & Applications Symposium
Towards combating rumors in social networks: Models and metrics
Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery
| Hi-index | 0.01 |
Social interactions are conduits for various processes spreading through a population, from rumors and opinions to behaviors and diseases. In the context of the spread of a disease or undesirable behavior, it is important to identify blockers: individuals that are most effective in stopping or slowing down the spread of a process through the population. This problem has so far resisted systematic algorithmic solutions. In an effort to formulate practical solutions, in this paper we ask: Are there structural network measures that are indicative of the best blockers in dynamic social networks? Our contribution is two-fold. First, we extend standard structural network measures to dynamic networks. Second, we compare the blocking ability of individuals in the order of ranking by the new dynamic measures. We found that overall, simple ranking according to a node's static degree, or the dynamic version of a node's degree, performed consistently well. Surprisingly the dynamic clustering coefficient seems to be a good indicator, while its static version performs worse than the random ranking. This provides simple practical and locally computable algorithms for identifying key blockers in a network.