physics and complexity
play

Physics and Complexity David Sherrington University of Oxford & - PowerPoint PPT Presentation

Physics and Complexity David Sherrington University of Oxford & Santa Fe Institute Physics Dictionary definition: Branch of science concerned with the nature and properties of matter and energy But today I want to use it as much as a


  1. Physics and Complexity David Sherrington University of Oxford & Santa Fe Institute

  2. Physics Dictionary definition: Branch of science concerned with the nature and properties of matter and energy But today I want to use it as much as a mind-set with valuable methodologies And to show application to many complex systems in many different arenas

  3. Physics as sometimes portrayed Particle Physics Cosmology ‘Fundamental’ particles How it all began Search for the ‘Theory of everything’

  4. But not today ‘More is different’ Particle Physics Cosmology ‘Fundamental’ particles How it all began ‘Theory of everything’ TOE is by no means the whole story Many body systems often give new behaviour through co-operation Both ‘fundamental’ and applicable

  5. Examples of emergent phenomena • Superconductivity • Magnetism • Giant Magnetoresistence • Quantum Hall Effect

  6. Useful & often give very high accuracy • Superconductivity – Flux quantization • Magnetism • Giant Magnetoresistence – Basis of modern high capacity data storage • Quantum Hall Effect – Quantized conductivity plateaux Highest accuracy measurements of fundamental constants even in dirty systems

  7. Complexity/Complex Systems • Many body systems • Cooperative behaviour complex – non-trivial and new – not simply anticipated from microscopics – even with simple individual units – and simple interaction rules • But with surprising conceptual similarities between superficially different systems

  8. Typical approach • Essentials? – Minimal models – Comparisons/checks: e.g. simulation – Analysis: maths & ansätze • Important consequences? • Universalities? • Conceptualization Build • Generalization • Application

  9. Key ingredients Frustration Conflicts Disorder Frozen or time-dependent; e.g. uncertainty

  10. Emphasis • Novel physics • New concepts • Minimalist models • Interdisciplinary transfers • Much ubiquity, some differences • Relevance of noise and memory • Applicability

  11. Examples Spin glasses Biology Hard Optimization Economics Information Science Computer Science Glassy Materials Mathematical Physics Probability Theory

  12. Examples Spin glasses Biology Hard Optimization Economics Information Science Computer Science Glassy Materials Mathematical Physics Probability Theory

  13. Rugged Landscape Paradigm Two-dimensional cartoon of high dimensional concept Many metastable states Hierarchy Cost Valleys within valleys to minimise Dynamics c.f. motion Coordinate Hard to minimise: sticks: glassiness

  14. General theoretical structure Control functions F ( { J } { , S }, { T } ) ij .. .. k ij .. Statics: Fixed Variable (variable) Dynamics: Slow Fast External influences

  15. Control functions, but who controls? • Physics: nature/physical laws • Biology: nature but not necess. equilibrium • Hard optimization: we choose algorithms • Information science: we have choice • Markets: partly supervising bodies, partly manufacturers, partly speculators • Society: governments can change rules

  16. Physics: Magnets: Spin glasses • Disordered magnetic alloys e.g. Au 1- x Fe x – Competitive magnetic interactions Antiferro Ferro – No periodicity → no simple best compromise • Non-periodic magnetic moment freezing • Slow macrodynamics/ history-dependence/ aging • Similar for site or bond disorder

  17. Phase transitions & preparation-dependence Susceptibility Field-cooled Zero-field cooled AuFe T g non-equilibrium equilibrium

  18. Minimalist Model = − � s � � 1 Cost or H J s s Hamiltonian ij i j Spin up/down ( ) ij Magnetic elements Quenched random interaction: ± Frustration & Disorder

  19. Minimalist Model = − � H J s s ij i j ( ) ij Simulations ~ experiment Range-free case soluble but very subtle

  20. “The Dean’s Problem” Allocate N students to 2 residences with maximum happiness = + � s � � Satisfaction 1 H J s s ij i j To maximise Dorm A/B ( ) ij Inter-student friendship: ± � s = Also 0 i i

  21. Phase diagram Temperature/noise/uncertainty/Dean’s impatience No freezing Easy to equilibrate Ferromagnetic freezing Glassy Hard to equilibrate GFM Attractive bias Many metastable states ‘Rugged landscape Slow dynamics

  22. Examples Spin glasses Biology Hard Optimization Economics Information Science Computer Science Glassy Materials Mathematical Physics Probability Theory

  23. Examples • Minimizing a cost – e.g. distribution of tasks, partitioning • Satisfiability – Simultaneous satisfaction of ‘clauses’ • Error correcting codes – Capacity and accuracy

  24. Two issues • What is achievable? – Analogue: “statics”/equilibrium • May be hard to find? • Is it possible? • If achievable, how to achieve it? – Needs algorithms = dynamics • We may be able to devise • But glassiness can badly hinder efficacy

  25. Recent example of hard optimization from computer science K-satisfiability simultaneous satisfiability of many ‘clauses’ of length K ( or or ) and ( or or ) and ... x x x x x x 1 2 3 3 4 5 � � � � � � M # of clauses � � �� � � � � � � � N # of variables Phase transition( � ): SAT / UNSAT

  26. Compare: K-satisfiability N/M Phase transitions SAT α c -1 Simple algorithms stick HARD-SAT α d -1 Theoretically achievable limit UNSAT 0 Physicists recognised this subtlety through comparison with K-spin glass

  27. Where the idea came from Potts or K (>2) -spin glass T RS T d Dynamical transition RSB1 T s Thermodynamical transition RSB2 RSB=Glassy 0 Originally looked at as a purely intellectually interesting extension

  28. Similarly: error-correcting codes Redundancy RETRIEVABLE RETRIEVABLE Normal algorithms stick HARD TO RETRIEVE Shannon limit UNRETRIEVABLE And now we know why 0

  29. In fact, more regimes Clustering: Random K-SAT UNSAT SAT HARD EASY α α d α c α s α *

  30. New algorithms • Understanding brings opportunities • Normal physics – Algorithms given • Artificial systems – We can design algorithms • e.g. Computational – Simulated annealling – Simulated tempering – Clustering……. Great advance: Survey propagation

  31. Simulated annealing effective stat. mech./thermodynamics � = − Z exp( Cost kT / ) anneal configurations Artificial ‘temperature’ T anneal Min Cost = Lim T ln Z A → T 0 A Optimum achievable Achieving it requires (algorithmic) dynamics Frustration & disorder → glassiness But we can choose the dynamics

  32. Landscape paradigm for hard optimization Cost obstacles Steepest descent gets stuck

  33. Simulated annealing Probabilistic hill-climbing Add ‘temperature’: freedom −∆ P move ( ) ~ exp( C T / ) Cost A T A Annealing temperature Variables

  34. Simulated annealing Gradually reduce T A Cost T A Annealing temperature Variables

  35. Simulated annealing Gradually reduce T A Cost T A Annealing temperature Variables

  36. Simulated annealing Hopefully Cost Variables Good basic tool but now better ones

  37. Examples Spin glasses Biology Hard Optimization Economics Information Science Computer Science Glassy Materials Mathematical Physics Probability Theory

  38. ‘Statistical physics of the brain’

  39. Typical neuron Schematize � (a) � (b)

  40. Schematic neural network Input Output

  41. Mathematical modelling j 1 i j 2 j 3 • Neuronal activity: V i • Synaptic weights: J ij > 0 switch-on, < 0 switch-off = � • Total input: U J V i ij j j

  42. Consequence of input ‘potential’ Output activity of neuron/ probability of firing Rounding ~ “temperature” T Input potential • and so on through the network

  43. Maps to analogue of spin glass � � µ µ = − = µ ξ ξ H J S S ; J ij i j ij i j ij Quasi-random +/- but trained Synaptic response

  44. Attractors: tuned metastable states • Associative memory ‘attractors’ ~ memorized patterns ‘basins of attraction’ determined by { J ij } • Many memories ~ many attractors require frustration Phase space

  45. Rugged landscape analogy Valleys ~ attractors Sculpture ~ learning { s i } { J ij } Different timescales fast retrieval slow learning

  46. Phase diagram: Hopfield model Synaptic ‘temperature’ Para (No attractors) ‘Spin glass’ (metastable attractors unrelated to memories) Retrieval Retrieval c.f. ferro (c.f. ferromagnet) Capacity: Pattern interference noise

  47. Extensions • Artificial neural networks – We design • Non-biological elements • Train by experience • Other biological evolution – self-train/select • maybe without knowing what is “good” • e.g. evolution of proteins from heteropolymeric soup • Autocatalytic sets

  48. Examples Spin glasses Biology Hard Optimization Economics Information Science Computer Science Glassy Materials Mathematical Physics Probability Theory

Recommend


More recommend