Computational aspects of analyzing social network dynamics

Authors:
Chris Barrett;Harry B. Hunt;Madhav V. Marathe;S. S. Ravi;Daniel J. Rosenkrantz;Richard E. Stearns;Mayur Thakur
Affiliations:
Network Dynamics and Simulation Science Laboratory, Virginia Bioinformatics Institute and Virginia Tech, Blacksburg, VA;Department of Computer Science, University at Albany-SUNY, Albany, NY;Network Dynamics and Simulation Science Laboratory, Virginia Bioinformatics Institute and Virginia Tech, Blacksburg, VA;Department of Computer Science, University at Albany-SUNY, Albany, NY;Department of Computer Science, University at Albany-SUNY, Albany, NY;Department of Computer Science, University at Albany-SUNY, Albany, NY;Department of Computer Science, University of Missouri-Rolla, Rolla, MO
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 10
Cited 4

On the computational complexity of finite cellular automata

Journal of Computer and System Sciences
Growing artificial societies: social science from the bottom up

Growing artificial societies: social science from the bottom up
A brief history of cellular automata

ACM Computing Surveys (CSUR)
Introduction to Multiagent Systems

Introduction to Multiagent Systems
On the complexity of verifying concurrent transition systems

Information and Computation
Treewidth: Algorithmoc Techniques and Results

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Reachability problems for sequential dynamical systems with threshold functions

Theoretical Computer Science - Mathematical foundations of computer science
Why Systolic Architectures?

Computer
On computational complexity of counting fixed points in symmetric boolean graph automata

UC'05 Proceedings of the 4th international conference on Unconventional Computation
Influential nodes in a diffusion model for social networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?

Bio-Inspired Computing and Communication
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems

Theoretical Computer Science
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

International Journal of Data Mining and Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by applications such as the spread of epidemics and the propagation of influence in social networks, we propose a formal model for analyzing the dynamics of such networks. Our model is a stochastic version of discrete dynamical systems. Using this model, we formulate and study the computational complexity of two fundamental problems (called reachability and predecessor existence problems) which arise in the context of social networks. We also point out the implications of our results on other computational models such as Hopfield networks, communicating finite state machines and systolic arrays.