{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T13:14:17Z","timestamp":1718025257278},"reference-count":44,"publisher":"Elsevier BV","issue":"30","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,7,8]],"date-time":"2015-07-08T00:00:00Z","timestamp":1436313600000},"content-version":"vor","delay-in-days":1468,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1016\/j.tcs.2011.02.027","type":"journal-article","created":{"date-parts":[[2011,2,20]],"date-time":"2011-02-20T09:23:55Z","timestamp":1298193835000},"page":"3932-3946","source":"Crossref","is-referenced-by-count":18,"title":["Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems"],"prefix":"10.1016","volume":"412","author":[{"given":"Chris","family":"Barrett","sequence":"first","affiliation":[]},{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"additional","affiliation":[]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[]},{"given":"S.S.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Daniel J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]},{"given":"Richard E.","family":"Stearns","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2011.02.027_br000005","series-title":"The Complexity of Cooperation","author":"Axelrod","year":"1994"},{"key":"10.1016\/j.tcs.2011.02.027_br000010","series-title":"Modeling and Simulation of Biological Networks","article-title":"Modeling and simulation of large biological, information and socio-technical systems: an interaction-based approach","volume":"vol. 64","author":"Barrett","year":"2007"},{"key":"10.1016\/j.tcs.2011.02.027_br000015","series-title":"Interactive Computation: The New Paradigm","first-page":"353","article-title":"Modeling and simulation of large-scale biological, information and socio-technical systems: an interaction based approach","author":"Barrett","year":"2006"},{"key":"10.1016\/j.tcs.2011.02.027_br000020","doi-asserted-by":"crossref","unstructured":"C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, Analysis problems for sequential dynamical systems and communicating state machines, in: Proc. 26th Mathematical Foundations of Computer Science, MFCS 2001, Sept. 2001, pp. 159\u2013172.","DOI":"10.1007\/3-540-44683-4_15"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2011.02.027_br000025","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0304-3975(02)00395-X","article-title":"Reachability problems for sequential dynamical systems with threshold functions","volume":"295","author":"Barrett","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2011.02.027_br000030","doi-asserted-by":"crossref","unstructured":"C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, Predecessor and permutation existence problems for sequential dynamical systems, in: Proceedings of the International Conference on Discrete Models for Complex Systems, DM-CS 2003, Lyon, France, June 2003, pp. 69\u201380.","DOI":"10.46298\/dmtcs.2314"},{"issue":"8","key":"10.1016\/j.tcs.2011.02.027_br000035","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.jcss.2006.03.006","article-title":"Complexity of reachability problems for finite discrete dynamical systems","volume":"72","author":"Barrett","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2011.02.027_br000040","unstructured":"C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, M. Thakur, Computational aspects of analyzing social network dynamics, in: Proceedings of the International Joint Conference on AI, IJCAI 2007, Hyderabad, India, Jan. 2007, pp. 2268\u20132273."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2011.02.027_br000045","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2007.04.026","article-title":"Predecessor existence problems for finite discrete dynamical systems","volume":"386","author":"Barrett","year":"2007","journal-title":"Theoret. Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2011.02.027_br000050","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0096-3003(98)10114-5","article-title":"Elements of a theory of simulation II: sequential dynamical systems","volume":"107","author":"Barrett","year":"2000","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2011.02.027_br000055","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0096-3003(00)00042-4","article-title":"Elements of a theory of simulation III: equivalence of SDS","volume":"122","author":"Barrett","year":"2001","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2011.02.027_br000060","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0096-3003(97)10166-7","article-title":"Elements of a theory of simulation I: sequential CA over random graphs","volume":"98","author":"Barrett","year":"1999","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2011.02.027_br000065","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, Treewidth: algorithmic techniques and results, in: Proceedings of the 22nd Symposium on Mathematical Foundations of Computer Science, 1997, pp. 29\u201336.","DOI":"10.1007\/BFb0029946"},{"key":"10.1016\/j.tcs.2011.02.027_br000070","series-title":"Growing Artificial Societies: Social Science from the Bottom Up","author":"Epstein","year":"1996"},{"key":"10.1016\/j.tcs.2011.02.027_br000075","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1038\/nature02541","article-title":"Monitoring and mitigating smallpox epidemics: strategies drawn from a census data instantiated virtual city","volume":"429","author":"Eubank","year":"2004","journal-title":"Nature"},{"key":"10.1016\/j.tcs.2011.02.027_br000080","doi-asserted-by":"crossref","unstructured":"D. Easley, J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, To be published by Cambridge University Press, 2010. (Pre-publication draft available from http:\/\/www.cs.cornell.edu\/home\/kleinber\/).","DOI":"10.1017\/CBO9780511761942"},{"key":"10.1016\/j.tcs.2011.02.027_br000085","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/j.tcs.2011.02.027_br000090","first-page":"453","article-title":"NP-complete problems in cellular automata","volume":"1","author":"Green","year":"1987","journal-title":"Complex Systems"},{"key":"10.1016\/j.tcs.2011.02.027_br000095","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.2001.2920","article-title":"On the complexity of verifying concurrent transition systems","volume":"173","author":"Harel","year":"2002","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/j.tcs.2011.02.027_br000100","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/S0097539793304601","article-title":"The complexity of planar counting problems","volume":"27","author":"Hunt","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2011.02.027_br000105","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.physd.2007.06.003","article-title":"Algorithms for computing preimages of cellular automata configurations","volume":"233","author":"Jeras","year":"2007","journal-title":"Physica D"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2011.02.027_br000110","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","article-title":"Theory of cellular automata: a survey","volume":"334","author":"Kari","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2011.02.027_br000115","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, E. Tardos, Influential nodes in a diffusion model for social networks\u201d, in: Proc. 32nd International Colloquium on Automata, Languages and Programming, ICALP, Lisbon, Portugal, Jul. 2005, pp. 1127\u20131138.","DOI":"10.1007\/11523468_91"},{"key":"10.1016\/j.tcs.2011.02.027_br000120","doi-asserted-by":"crossref","unstructured":"S. Kosub, C. Homan, Dichotomy results for fixed-point counting in boolean dynamical systems, in: Proc. 10th Italian Conference on Theoretical Computer Science, ICTCS 2007, Rome, Italy, Oct. 2007, pp. 163\u2013174.","DOI":"10.1142\/9789812770998_0018"},{"issue":"3","key":"10.1016\/j.tcs.2011.02.027_br000125","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s11786-007-0038-y","article-title":"Dichotomy results for fixed-point existence problems for boolean dynamical systems","volume":"1","author":"Kosub","year":"2008","journal-title":"Math. Comput. Sci."},{"key":"10.1016\/j.tcs.2011.02.027_br000130","doi-asserted-by":"crossref","unstructured":"V. Kumar, M. Macauley, H. Mortveit, Limit set reachability in asynchronous graph dynamical systems, in: Proc. Third International Workshop on Reachability Problems, RP 2009, Palaiseau, France, Sept. 2009, pp. 217\u2013232.","DOI":"10.1007\/978-3-642-04420-5_20"},{"issue":"1","key":"10.1016\/j.tcs.2011.02.027_br000135","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures","volume":"15","author":"Kung","year":"1982","journal-title":"IEEE Comput."},{"key":"10.1016\/j.tcs.2011.02.027_br000140","series-title":"Encyclopedia of Complexity and System Science","article-title":"A mathematical formalism for agent-based modeling","author":"Laubenbacher","year":"2008"},{"key":"10.1016\/j.tcs.2011.02.027_br000145","doi-asserted-by":"crossref","first-page":"4157","DOI":"10.1090\/S0002-9939-08-09543-9","article-title":"On enumeration of conjugacy classes of coxeter elements","volume":"136","author":"Macauley","year":"2008","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2011.02.027_br000150","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0012-365X(00)00115-1","article-title":"Discrete, sequential dynamical systems","volume":"226","author":"Mortveit","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2011.02.027_br000155","series-title":"An Introduction to Sequential Dynamical Systems","author":"Mortveit","year":"2007"},{"key":"10.1016\/j.tcs.2011.02.027_br000160","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1146\/annurev.soc.28.110601.141117","article-title":"From factors to actors: computational sociology and agent-based modeling","volume":"28","author":"Macy","year":"2002","journal-title":"Ann. Rev. Sociol."},{"key":"10.1016\/j.tcs.2011.02.027_br000165","unstructured":"M. Mahajan, Studies in language classes defined by different types of time-varying cellular automata, Ph.D. Thesis, Indian Institute of Technology, Madras, 1992."},{"key":"10.1016\/j.tcs.2011.02.027_br000170","unstructured":"C. Nichitiu, E. Remila, Simulations of graph automata, in: Proc. MFCS\u201998 Satellite Workshop on Cellular Automata, Brno, Czech Republic, Aug. 1998, pp. 69\u201378."},{"key":"10.1016\/j.tcs.2011.02.027_br000175","unstructured":"P. Orponen, An overview of the computational power of recurrent neural networks, in: Proc. 9th Finnish AI Conference STeP 2000 - Millennium of AI, H. Hyotyniemi, ed. Espoo, Finland, 2000, pp. 89\u201396."},{"key":"10.1016\/j.tcs.2011.02.027_br000180","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/j.tcs.2011.02.027_br000185","doi-asserted-by":"crossref","unstructured":"J. Simon, Space-bounded probabilistic turing machine complexity classes are closed under complement, in: Proc. ACM STOC,1981, pp. 158\u2013167.","DOI":"10.1145\/800076.802469"},{"key":"10.1016\/j.tcs.2011.02.027_br000190","unstructured":"M. Saks, S. Zhou, RSPACE(n) is contained in DSPACE(n3\/2), in: Proc. IEEE FOCS 1995, pp. 344\u2013353."},{"issue":"1","key":"10.1016\/j.tcs.2011.02.027_br000195","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/349194.349202","article-title":"A brief history of cellular automata","volume":"32","author":"Sarkar","year":"2000","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.tcs.2011.02.027_br000200","first-page":"219","article-title":"Computation of explicit preimages in one-dimensional cellular automata applying the De Bruijn diagram","volume":"3","author":"Soto","year":"2008","journal-title":"J. Cellular Automata"},{"issue":"1","key":"10.1016\/j.tcs.2011.02.027_br000205","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcss.1995.1009","article-title":"On the computational complexity of finite cellular automata","volume":"50","author":"Sutner","year":"1995","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2011.02.027_br000210","series-title":"Proc. UC\u201905 - Fourth International Conference on Unconventional Computation","first-page":"191","article-title":"On computational complexity of counting fixed points in symmetric boolean graph automata","volume":"vol. 3699","author":"Tosic","year":"2005"},{"key":"10.1016\/j.tcs.2011.02.027_br000215","series-title":"Theory and Applications of Cellular Automata","year":"1987"},{"key":"10.1016\/j.tcs.2011.02.027_br000220","series-title":"An Introduction to MultiAgent Systems","author":"Wooldridge","year":"2002"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511001472?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511001472?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T05:31:48Z","timestamp":1637299908000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511001472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":44,"journal-issue":{"issue":"30","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S0304397511001472"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.02.027","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}