Modeling and simulation of large biological, information and socio-technical systems: An interaction based approach

Interactive Computation: The New Paradigm

Volumn , Issue , 2006, Pages 353-392

  Barrett, Chris ^a   Eubank, Stephen ^a   Marathe, Madhav ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84856966141     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-34874-3_14     Document Type: Chapter

References (86)

1. R. Axtell, J. Epstein. Growing Artificial Societies: Social Science From the Bottom Up. MIT Press/Brookings Institution, 1996.
2. R. Albert, A. Barabási. Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 2002, pp. 47-97.
3. K. Atkins, C. Barrett, C. Homan, A. Marathe, M. Marathe, S. Thite. Marketecture: A Simulation-Based Framework for Studying Experimental Deregulated Power Markets, Proc. 6th IAEE European Conf. Modeling in Energy Economics and Policy, Zurich, 2004.
4. L. Bajaj, M. Takai, R. Ahuja, R. Bagrodia. Simulation of Large Scale Communication Systems. Proc. MILCOM' 99, 1999.
5. A. Barabási, R. Albert. Emergence of scaling in random networks. Science, 286, 1999.
6. C. Barrett, S. Eubank, M. Marathe, H. Mortveit, C. Reidys. Science and Engineering of Large Scale Socio-Technical Simulations, Proc. 1st Int'l Conf. on Grand Challenges in Simulations, held as a part of Western Simulation Conference, San Antonio Texas, 2002.
7. C. Barrett, S. Eubank, V. Anil Kumar, M. Marathe. Understanding Large Scale Social and Infrastructure Networks: A Simulation Based Approach, SIAM News 37(4), 2004. Appears as part of Math Awareness Month on The Mathematics of Networks.
8. M. Batty. Hierarchy in Cities and City Systems, CASA Working paper series 85-11-4, 2005. To appear in Hierarchy in natural and Social Sciences, D. Pumain, Ed., Kluwer Academic Publishers.
9. C. Barrett, R. Beckman, K. Berkbigler, K. Bisset, B. Bush, K. Campbell, S. Eubank, K. Henson, J. Hurford, D. Kubicek, M. Marathe, P. Romero, J. Smith, L. Smith, P. Speckman, P. Stretz, G. Thayer, E. Eeckhout, W. Williams. TRAN-SIMS: Transportation Analysis Simulation System. Tech. Report LA-UR-00-1725, Los Alamos National Laboratory Unclassified Report, 2001.
10. C. Barrett, C. Reidys. Elements of a Theory of simulation I: Sequential CA over random graphs Appl. Math. and Comput. 98:241-259, 1999.
11. C. Barrett, H. Mortveit, C. Reidys. Elements of a Theory of simulation II: Sequential dynamical systems. Appl. Math. and Comput. 107(2-3), pp. 121-136, 2000.
12. G. Istrate, A. Hansson, S. Thulasidasan, M. Marathe, C. Barrett. RESTORED: A Methodology for Semantic Compression of TCP Traces. Tech. Report, Los Alamos National Laboratory, submitted.
13. C. Barrett, M. Marathe, H. Mortveit, S. Ravi, C. Reidys, J. Smith. AdHopNet: Advances in Simulation-based Design and Analysis of Ad-Hoc Networks Tech. Report LA-UR 00-1567, Los Alamos National Laboratory, 2000.
14. C. Barrett, M. Marathe, J. Smith, S. Ravi. A mobility and traffic generation framework for modeling and simulating ad hoc communication networks. ACM Symp. on Applied Computing (SAC), 2002, pp. 122-126.
15. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns. Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. Proc. Int'l Symp. on Math. Foundations of Computer Science (MFCS'01), Czech Republic, pp. 159-172, 2001.
16. R. Beckman, K. Baggerly, M. McKay. Creating synthetic base-line populations, Transportation Research Part A - Policy and Practice 30, pp. 415-429, 1996.
17. S. Buss, C. Papadimitriou, J. Tsitsiklis. On the Predictability of Coupled Automata: An Allegory About Chaos. Complex Systems 1(5), pp. 525-539, 1991.
18. D. Brand, P. Zafiropulo. On Communicating Finite State Machines. J. ACM 30(2), pp. 323-342, 1983.
19. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, P. Tosic. Gardens of Eden and fixed points in sequential dynamical systems. Proc. Int'l Conf. on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG), Paris, pp. 95-110, 2001.
20. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns, M. Thakur. Complexity of Predecessor Existence Problems for Finite Discrete Dynamical Systems. Tech. Report, Virginia Tech, 2004. Preliminary Version appeared in Discrete Models of Complex Systems (DMCS) 2002.
21. C. Barrett, H. Hunt III, M. Marathe, S. Ravi, D. Rosenkrantz, R. Stearns. Reachability Problems for Sequential Dynamical Systems with Threshold Functions. Theoreti cal C om puter Science, 1-3, pp. 41-64, 2003.
22. C. Barrett, J. Smith, S. Eubank, Modern Epidemiology Modeling, in Scientific American, 2005.
23. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, J. Wiener. Graph structure in the web. Computer Networks, 33, 2000.
24. C. Barrett, M. Marathe, H. Mortveit, C. Reidys. SDS Based Specification of Large IP Networks Tech. Report, Los Alamos National Laboratory, 2001.
25. C. Barrett, M. Drozda, D. Engelhart, V. Anil Kumar, M. Marathe, M. Morin, S. Ravi, J. Smith. Structural Analysis of Ad Hoc Networks: Implications for Protocol Performance, Proc. IEEE Int'l Conf. on Wireless and Mobile Computing, Communications and Networking, 2005.
26. K. Carley, D. Fridsma, E. Casman, N. Altman, J. Chang, J. Kaminski, D. Nave, A. Yahja. BioWar: Scalable Multi-Agent Social and Epidemiological Simulation of Bioterrorism Events. Prof. NAACSOS Conf., Pittsburgh, PA, 2003.
27. R. Breiger, K. Carley, Eds., NRC workshop on Social Network Modeling and Analysis, pp. 133-145, National Research Council, 2003.
28. F. Chung, L. Lu. Connected components in a random graph with given degree sequences. Annals of Combinatorics, 6:125-145, 2002.
29. J. Cowie, D. Nicol, A. Ogielski. Modeling 100 000 Nodes and Beyond: Self-Validating Design. DARPA/NIST Workshop on Validation of Large Scale Network Simulation Models, 1999.
30. N. Creignou, S. Khanna, M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, 2001.
31. DYNAMIT. Massachusetts Institute of Technology, Cambridge, Massachusetts. http://mit.edu/its/dynamit.html, 1999.
32. A. DeHon. Very Large Scale Spatial Computing Proc. Third Int'l Conf. on Unconventional Models of Computation (UMC'02), 15-19, pp. 27-37, 2002.
33. S. Eubank, H. Guclu, V. Anil Kumar, M. Marathe, A. Srinivasan, Z. Toroczkai, N. Wang. Modeling Disease Outbreaks in Realistic Urban Social Networks, Nature, 429, pp. 180-184, 2004.
34. S. Eubank, V. Anil Kumar, M. Marathe, A. Srinivasan, N. Wang. Structural and Algorithmic Aspects of Large Social Networks, Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 711-720, 2004.
35. S. Eubank, V. Anil Kumar, M. Marathe, A. Srinivasan, N. Wang. Structure of Social Contact Networks and their Impact on Epidemics. to appear in AMS-DIMACS Special Volume on Epidemiology, 2005.
36. P. Floreen, P. Orponen. Complexity Issues in Discrete Hopfield Networks Comp. and Learning Complexity of Neural Networks: Advanced Topics, Edited by I. Parberry, 1994.
37. J. Epstein. Generative Social Science: Studies in Agent-Based Computational Modeling, Princeton University Press, Forthcoming, 2005.
38. I. Foster and G. Kesselman, Eds. The Grid: Blueprint for a New Computing Infrastructure, 2000.
39. C. Faloutsos, P. Faloutsos, M. Faloutsos. On Power-Law Relationships of the Internet Topology, Proc. ACM SIGCOMM, 1999.
40. M. Garzon. Models of Massive Parallelism: Models of Cellular Automata and Neural Networks, EATCS Monographs on Theoretical Computer Science, Springer Verlag, 1995.
41. D. Goldin, S. Smolka, P. Attie, E. Sonderegger. Turing Machines, Transition Systems, and Interaction Information and Computation, 194(2), pp. 101-128, 2004.
42. H. Gutowitz, Ed. Cellular Automata: Theory and Experiment North Holland, 1989.
43. D. Harel, O. Kupferman, M. Vardi. On the complexity of verifying concurrent transition systems. Proc. 8th Int. Conf. Concurrency Theory (CONCUR'97), Warsaw, Poland, July 1997, Vol. 1243 LNCS, pp. 258-272, 1997.
44. Y. Haimes, B. Horowitz. Modeling Interdependent Infrastructures for Sustainable Counterterrorism. Journal of Infrastructure Systems, pp. 33-41, 2004.
45. L. Hartwell, J. Hopfield, S. Leibler, A. Murray. From Molecular to Modular Cell Biology, Nature, Vol. 402, pp. C47-C51, 1999.
46. H. Hethcote. The Mathematics of Infectious Diseases SIAM Review, 42(4):599-653, 2000.
47. B. Hillel. Cities as Movement Economies. Urban Design Int'l 1, pp. 49-60, 1996.
48. J. Hopfield. Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proc. of National Academy of Sciences of the USA, No. 81, pp. 3088-3092, 1982.
49. H. Hunt III, R. Stearns, M. Marathe. Relational Representability, Local Reductions and the Complexity of Generalized Satisfiability Problem. Tech. Report No. LA-UR-00-6108, Los Alamos National Laboratory, 2000.
50. H. Hunt III, R. Stearns, M. Marathe. Strongly Local Reductions and the Complexity/Efficient Approximability of Algebra and Optimization on Abstract Algebraic Structures, Proc. Int'l Conf. on Symbolic and Algebraic Computations (ISAAC), pp. 183-191, 2001.
51. H. Hunt III, D. Rosenkrantz, C. Barrett, M. Marathe, S. Ravi. Complexity of Analysis and Verification Problems for Communicating Automata and Discrete Dynamical Systems. Tech. Report No. LA-UR-01-1687, Los Alamos National Laboratory, 2001.
52. T. Ideker, T. Galitski, L. Hood. A New Approach to Decoding Life, Ann. Review of Genomics and Human Genetics, Vol. 2, pp. 343-372, 2001.
53. G. Istrate, M. Marathe, S. Ravi. Adversarial models in evolutionary game dynamics. Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA'2001), Washington, DC, pp. 719-720, 2001.
54. H. Kitano. Computational Systems Biology, Nature 420, pp. 206-210, 2002.
55. J. Kleinberg. Navigation in a Small World. Nature 406, 2000.
56. H. Kung. Why Systolic Architectures. IEEE Computers, 15(1), pp. 37-42, 1982.
57. R. Little. Controlling Cascading Failure: Understanding the Vulnerabilities of Interconnected Infrastructures. J. Ur ba n Tech no logy, 9(1), 109-123, 2002.
58. R. Liu, E. Lloyd, M. Marathe, R. Ramanathan, S. Ravi. Algorithmic Aspects of Topology Control Problems For Ad-hoc Networks, ACM/Baltzer J. Mobile Networks and Applications (MONET), 10, pp. 19-34, 2005.
59. M. Liu, M. Subramaniam. An Approach for Formal Specification and Verification of Large Scale Simulation Systems Using Abstract State Machines, Los Alamos National Laboratory Tech. Report, 2005.
60. R. Laubenbacher, B. Pareigis. Decomposition and simulation of sequential dynamical systems, Advances in Applied Math, 30, pp. 655-678, 2003.
61. E. Lee, A. Wallace, J. Mitchell, D. Mendon, J. Chow. Managing disruptions to critical interdependent infrastructures in the context of the 2001 WorldTrade Center attack, in Beyond September 11: An account of post-disaster research M. F. Myers, Ed. Boulder, CO: Natural Hazards Research and Applications Information Center, University of Colorado, Program on Environment and Behavior, Special Publication 39, pp. 165-198, 2003.
62. N. Margolus. An Embedded DRAM Architecture for Large-Scale Spatial-Lattice Computations Proc. 27th Annual Int'l Symp. on Computer Architecture (ISCA), pp. 149-158, 2000.
63. N. Margolus, T. Toffoli. Cellulae Automata Machines: A New Environment for Modeling, Cambridge: MIT press, 1987.
64. R. Milner. Communicating and Mobile systems: the π-calculus Cambridge University Press, 1999.
65. R. Milner. Elements of Interaction, Comm. ACM 36:1, pp. 78-89, 1993.
66. C. Moore. Unpredictability and Undecidability in Dynamical Systems. Physical Review Letters 64(20), pp 2354-2357, 1990.
67. H. Mortveit, C. Reidys. Discrete, Sequential Dynamical Systems. Discrete Mathematics 226:281-295, 2001.
68. K. Nagel, M. Schrekenberg. A Cellular Automata Model for Freeway Traffic. J. de Physique I, France, 2:2221, 1995.
69. K. Nagel, P. Stretz, M. Pieck, S. Leckey, R. Donnelly, and C. Barrett. TRAN-SIMS Traffic Flow Characteristics. Transportation Research Board Annual Meeting, 1998.
70. K. Nagel, M. Paczuski. Emergent traffic jams. Physical Review E, 51:2909-2918, 1995.
71. M. Newman, The structure and function of complex networks. SIAM Review 45, 167-256, 2003.
72. C. Nicthiu, E. Remila. Simulations of graph automaton. Proc. Mathematical Foundations of Computer Science (MFCS'98) Satellite workshop on graph automata, Th Worsch and R. Wolmar Eds, Universität Karlsruhe, pp. 69-78, 1998.
73. P. Orponen. Computational Complexity of Neural Networks: A Survey, Nordic J. of Computing 1(1), pp. 94-110, 1994.
74. A. Rabinovich. Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. Information and Computation 127(2), pp. 164-185, 1997.
75. B. Raney, N. Cetin, A. Völlmy, A. Vrtic, K. Axhausen, K. Nagel, An Agent-Based Microsimulation Model of Swiss Travel: First Results, Networks and Spatial Economics 3, pp. 23-41, 2003.
76. M. Schreckenberg, A. Schadschneider, K. Nagel, N. Ito. Discrete stochastic models for traffic flow. Physical Review E 51:29-39, 1995.
77. P. Speckman, K. Vaughn, E. Pas. Generating Household Activity-Travel Patterns (HATPs) for Synthetic Populations. Transportation Research Board Annual Meeting, 1997.
78. P. Speckman, K. Vaughn, E. Pas. A Continuous Spatial Interaction Model: Application to Home-Work Travel in Portland, Oregon. Transportation Research Board Annual Meeting, 1997.
79. Y. Sheffi. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming methods. Prentice Hall, 1985.
80. R. Stearns, H. Hunt III. An algebraic model for combinatorial problems. SIAM J. Computing 25, No. 2, 448-476, 1996.
81. S. Shukla, H. Hunt III, D. Rosenkrantz, and R. Stearns. On the Complexity of Relational Problems for Finite State Processes. Proc. Int'l Colloquium on Automata Programming and Languages (ICALP), pp. 466-477, 1996.
82. J. Tripp, A. Hansson, M. Gokhale, H. Mortveit. Partitioning Hardware and Software for Reconfigurable Supercomputing Applications: A Case Study, Proc. Supercomputing (SC'05), 2005.
83. D. Watts, S. Strogatz. Collective dynamics of 'small-world' networks, Nature, vol. 393, pp. 440-442, 1998.
84. P. Wegner. Interactive Foundations of Computing, Theoretical Computer Science 192, pp. 315-351, 1998.
85. S. Wolfram, Ed. Theory and applications of cellular automata, World Scientific, 1987.
86. http://dimacs.rutgers.edu/Workshops/Opening/abstracts.html http://www.mel.nist.gov/div826/msid/sima/simconf/march04/phsi.pdf http://www.iupui.edu/ilight/symposium04/ILIGHTPPT/measrespon.pdf http://www.mgmt.purdue.edu/centers/seas/Research/Research.htm.