Computational aspects of analyzing social network dynamics

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2268-2273

  Barrett, Chris ^a   Hunt III, Harry B ^b   Marathe, Madhav V ^a   Ravi, S S ^b   Rosenkrantz, Daniel J ^b   Stearns, Richard E ^b   Thakur, Mayur ^c  

^a VIRGINIA BIOINFORMATICS INSTITUTE   (United States)

^b State University of New York   (United States)

^c University of Missouri Rolla   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATING FINITE STATE MACHINES; COMPUTATIONAL ASPECTS; COMPUTATIONAL MODEL; DISCRETE DYNAMICAL SYSTEMS; EXISTENCE PROBLEMS; FORMAL MODEL; HOPFIELD NETWORKS; NETWORK DYNAMICS;

ARTIFICIAL INTELLIGENCE; DYNAMICAL SYSTEMS; STOCHASTIC MODELS;

SOCIAL NETWORKING (ONLINE);

EID: 79952370117     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. R. Axelrod, The Complexity of Cooperation, Princeton University Press. Princeton, NJ, 1994.
2. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz and R. Stearns, "Reachability Problems for Sequential Dynamical Systems with Threshold Functions", Theoretical Computer Science, Vol. 295, Issues 1-3, Feb. 2003, pp. 41-64.
3. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz and R. E. Stearns, "Predecessor and Permutation Existence Problems for Sequential Dynamical Systems", Proceedings of the International Conference on Discrete Models for Complex Systems (DM-CS 2003), Lyon, France, June 2003.
4. C. Barrett, S. Eubank and M. V. Marathe, "Modeling and Simulation of Large-Scale Biological, Information and Socio-Technical Systems: An Interaction Based Approach", in Interactive Computation: The New Paradigm, edited by D. Goldin, S. Smolka and P.Wegner, Springer 2006.
5. H. Bodlaender, "Treewidth: Algorithmic Techniques and Results", Proceedings of the 22nd Symposium on Mathematical Foundations of Computer Science, 1997, pp. 29-36.
6. J. Epstein and R. Axtell, Growing Artificial Societies: Social Science from the Bottom Up, Brookings/MIT Press, 1996.
7. S. Eubank, H. Guclu, V. Anil Kumar, M. V. Marathe, A. Srinivasan, Z. Toroczkai and N. Wang, "Monitoring and Mitigating SmallPox Epidemics: Strategies Drawn from a Census Data Instantiated Virtual City", Nature, Vol. 429, May 2004, pp. 180-184.
8. F. Green, "NP-Complete Problems in Cellular Automata", Complex Systems, Vol. 1, No. 3, 1987, pp. 453-474.
9. D. Harel, O. Kupferman, and M. Y. Vardi, "On the complexity of verifying concurrent transition systems", Information and Computation, Vol. 173, 2002, pp. 143-161.
10. D. Kempe, J. Kleinberg and E. Tardos, "Influential Nodes in a Diffusion Model for Social Networks", Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005.
11. H. Kung, "Why Systolic Architectures", IEEE Computers, 15(1), 1982, pp. 37-42.
12. M.W.Macy and R.Willer, "From Factors to Actors: Computational Sociology and Agent-Based Modeling", Annual Review of Sociology, Vol. 28, 2002, pp. 143-166.
13. M. Mahajan, "Studies in Language Classes Defined by Different Types of Time-Varying Cellular Automata", Ph.D. Thesis, Indian Institute of Technology, Madras, 1992.
14. C. Nichitiu and E. Remila, "Simulations of Graph Automata", Proc. MFCS'98 Satellite Workshop on Cellular Automata, Brno, Czech Republic, Aug. 1998.
15. P. Orponen, "An Overview of the Computational Power of Recurrent Neural Networks", Proc. 9th Finnish AI Conference STeP 2000 - Millennium of AI, H. Hyotyniemi, ed. Espoo, Finland, 2000, pp. 89-96.
16. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
17. 3/2) ", Proc. IEEE FOCS 1995, pp. 344- 353.
18. P. Sarkar, "A Brief History of Cellular Automata", ACM Computing Surveys, Vol. 32, No. 1, 2000, pp. 80-107.
19. K. Sutner, "On the Computational Complexity of Finite Cellular Automata", Journal of Computer and System Sciences, Vol. 50, No. 1, Feb. 1995, pp. 87-97.
20. P. Tosic and G. Agha, "On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata", Proc. UC'05 - Fourth International Conference on Unconventional Computation, Sevilla, Spain, October 2005, Springer-Verlag LNCS series, Vol. 3699, pp. 191-205.
21. S. Wolfram (Editor), Theory and Applications of Cellular Automata, World Scientific, 1987.
22. M. Wooldridge, An Introduction to MultiAgent Systems, John Wiley & Sons, Chichester, England, 2002.