Computational Modeling
and Complexity Science

Allen B. Downey

Version 0.0.9

• Preface
  • Acknowledgements
  • Contributor List
• Graphs
  • What’s a graph?
  • Representing graphs
  • Random graphs
  • Connected graphs
  • Paul Erdős: peripatetic mathematician, speed freak
  • Iterators
  • Generators
• Analysis of algorithms
  • Order of growth
  • Analysis of basic operations
  • Analysis of search algorithms
  • Hashtables
  • Summing lists
  • List comprehensions
• Small world graphs
  • Analysis of graph algorithms
  • FIFO implementation
  • Stanley Milgram
  • Watts and Strogatz
  • Dijkstra
  • What kind of explanation is that?
• Scale-free networks
  • Zipf’s Law
  • Cumulative distributions
  • Closed-form distributions
  • Pareto distributions
  • Barabási  and Albert
  • Zipf, Pareto and power laws
• Cellular Automata
  • Wolfram
  • Implementing CAs
  • Classifying CAs
  • Randomness
  • Determinism
  • Structures
  • Universality
  • Falsifiability
  • What is this a model of?
• Games of Life
  • Abstract classes
  • Conway
  • Life patterns
  • Conway’s conjecture
  • Realism
  • Instrumentalism
  • Turmites
  • Percolation
• Self-organized criticality
  • Bak, Tang and Wiesenfeld
  • Spectral density
  • Fast Fourier Transform
  • Pink noise
  • Forest fire models
  • Reductionism and Holism
  • SOC, causation and prediction
• Agent-based models
  • Schelling
  • Agent-based models
  • Traffic jams
  • Boids
  • Ants
  • Sugarscape
  • Emergence
• Stochastic modeling
  • Monty Hall
  • Poincaré
  • Streaks and hot spots
  • Bayes’ theorem

This document was translated from L^AT_EX by H^EV^EA.