Computational Aspects of Analyzing Social Network Dynamics
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.
Cite
Text
Barrett et al. "Computational Aspects of Analyzing Social Network Dynamics." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Barrett et al. "Computational Aspects of Analyzing Social Network Dynamics." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/barrett2007ijcai-computational/)BibTeX
@inproceedings{barrett2007ijcai-computational,
title = {{Computational Aspects of Analyzing Social Network Dynamics}},
author = {Barrett, Christopher L. and Iii, Harry B. Hunt and Marathe, Madhav V. and Ravi, S. S. and Rosenkrantz, Daniel J. and Stearns, Richard Edwin and Thakur, Mayur},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {2268-2273},
url = {https://mlanthology.org/ijcai/2007/barrett2007ijcai-computational/}
}