260 likes | 431 Views
Chaotic Dynamics on Large Networks. J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the Chaotic Modeling and Simulation International Conference in Chania, Crete, Greece on June 3, 2008. What is a complex system?. Complex ≠ complicated
E N D
Chaotic Dynamics on Large Networks J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the Chaotic Modeling and Simulation International Conference in Chania, Crete, Greece on June 3, 2008
What is a complex system? • Complex ≠ complicated • Not real and imaginary parts • Not very well defined • Contains many interacting parts • Interactions are nonlinear • Contains feedback loops (+ and -) • Cause and effect intermingled • Driven out of equilibrium • Evolves in time (not static) • Usually chaotic (perhaps weakly) • Can self-organize, adapt, learn
A Physicist’s Neuron N inputs tanh x x
A General Model (artificial neural network) N neurons “Universal approximator,” N ∞ Solutions are bounded
Examples of Networks Other examples: War, religion, epidemics, organizations, …
Political System Information from others Political “state” a1 Voter a2 a3 aj = ±1/√N, 0 tanh x Democrat x Republican
Types of Dynamics • Static • Periodic • Chaotic Equilibrium “Dead” Limit Cycle (or Torus) “Stuck in a rut” Strange Attractor Arguably the most “healthy” Especially if only weakly so
Route to Chaos at Large N (=317) 400 Random networks Fully connected “Quasi-periodic route to chaos”
Average Signal from all Neurons All +1 N = b = 317 1/4 All −1
Simulated Elections 100% Democrat N = b = 317 1/4 100% Republican
Strange Attractors 10 1/4 N = b =
Competition vs. Cooperation 500 Random networks Fully connected b = 1/4 Competition Cooperation
Bidirectionality 250 Random networks Fully connected b = 1/4 Reciprocity Opposition
Connectivity 250 Random networks N = 317, b = 1/4 Dilute Fully connected 1%
Network Size 750 Random networks Fully connected b = 1/4 N = 317
What is the Smallest Chaotic Net? • dx1/dt = – bx1 + tanh(x4 – x2) • dx2/dt = – bx2 + tanh(x1 + x4) • dx3/dt = – bx3 + tanh(x1 + x2 – x4) • dx4/dt = – bx4 + tanh(x3 – x2) Strange Attractor 2-torus
Circulant Networks dxi /dt = −bxi + Σajxi+j
Diluted Circulant Network N = 317
Near-Neighbor Circulant Network N = 317
Summary of High-N Dynamics • Chaos is generic for sufficiently-connected networks • Sparse, circulant networks can also be chaotic (but the parameters must be carefully tuned) • Quasiperiodic route to chaos is usual • Symmetry-breaking, self-organization, pattern formation, and spatio-temporal chaos occur • Maximum attractor dimension is of order N/2 • Attractor is sensitive to parameter perturbations, but dynamics are not
A paper on this topic is scheduled to appear soon in the journal Chaos http://sprott.physics.wisc.edu/ lectures/networks.ppt (this talk) http://sprott.physics.wisc.edu/chaostsa/ (my chaos textbook) sprott@physics.wisc.edu (contact me) References