930 likes | 1.07k Views
Complexity and pain. The problem Definitions and explanations of complex systems, chaos, dynamics and emergence Approaches in pain (and palliative care) with examples. Complexity of pain on the molecular level. Dorsal horn. Neuropeptid system. Opioid system. Cholezystokinin.
E N D
The problem • Definitions and explanations of complex systems, chaos, dynamics and emergence • Approaches in pain (and palliative care) with examples
Polysynaptic modulation • Transmitter substances have also effects outside of the synaptic cleft • Increased transmitter concentrations can lead to a rather excitatoric or inhibitoric tone • This regards specially G-protein coupled receptors
Glia as neuromodulator • Astrocytes and glia eksprime receptors similar to neurons (evidence beyond others for NMDA, NK1, P2X4) • They send out transmitter substances (bl.a. SP, CGRP, glutamat), cytokines (bl.a. Il1, Il6, TNF) and modulate elimination of neurotransmitters • Possibly an important function in neuropathic pain Tsuda 2003
Principles of Complex Systems • Parts distinct from system. • System displays emergent order. • Not directly related to parts. • Define nature & function of system. • Disappear when whole is broken up. • Robust stability (“basins of attraction”). Emergent order = systemic properties which define health vs. disease.
Principles of Complex Systems • Unpredictable response • Chaos or sensitivity to initial conditions. • Response determines impact to system • Controlled experiments: reproducible results • Uncontrolled patients: unpredictable results Host response is unpredictable, yet it determines outcome.
Some explanations • Chaos (with help of Larry Liebovitch, Florida Atlantic University) • Dynamics (with help of J.C.Sprott, Department of Physics,University of Wisconsin – Madison)
These two sets of data have the same • mean • variance • power spectrum
RANDOM random x(n) = RND Data 1
CHAOS Deterministic x(n+1) = 3.95 x(n) [1-x(n)] Data 2
RANDOM random x(n) = RND Data 1
CHAOS deterministic x(n+1) = 3.95 x(n) [1-x(n)] Data 2 x(n+1) x(n)
CHAOS Definition predict that value Deterministic these values
CHAOS Definition Small Number of Variables x(n+1) = f(x(n), x(n-1), x(n-2))
CHAOS Definition Complex Output
CHAOS Properties Phase Space is Low Dimensional d , random d = 1, chaos phase space
CHAOS Properties Sensitivity to Initial Conditions nearly identical initial values very different final values
CHAOS Properties Bifurcations small change in a parameter one pattern another pattern
Time Series X(t) Y(t) Z(t) embedding
Phase Space Z(t) phase space set Y(t) X(t)
Phase Space Constructed by direct measurement: Measure X(t), Y(t), Z(t) Z(t) Each point in the phase space set has coordinates X(t), Y(t), Z(t) X(t) Y(t)
Analyzing Experimental Data The Good News: In principle, you can tell if the data was generated by a random or a deterministic mechanism.
Analyzing Experimental Data The Bad News: In practice, it isn’t easy.
Dynamics –the predator-prey example • A dynamic system is a set of functions (rules, equations) thatspecify how variables change over time.
Rabbit Dynamics • Let R = # of rabbits • dR/dt = bR - dR = rR r = b - d Birth rate Death rate • r > 0 growth • r = 0 equilibrium • r < 0 extinction
Exponential Growth • dR/dt = rR • Solution: R = R0ert R r > 0 r = 0 # rabbits r < 0 t time
Logistic Differential Equation • dR/dt = rR(1 - R) 1 R r > 0 # rabbits 0 t time
Effect of Predators • Let F = # of foxes • dR/dt = rR(1 - R - aF) Intraspecies competition Interspecies competition But… The foxes have their own dynamics...
Lotka-Volterra Equations • R = rabbits, F = foxes • dR/dt = r1R(1 - R - a1F) • dF/dt = r2F(1 - F - a2R) r and a can be + or -
Types of Interactions dR/dt = r1R(1 - R - a1F) dF/dt = r2F(1 - F - a2R) + a2r2 Prey- Predator Competition - + a1r1 Predator- Prey Cooperation -
Equilibrium Solutions • dR/dt = r1R(1 - R - a1F) = 0 • dF/dt = r2F(1 - F - a2R) = 0 Equilibria: • R = 0, F = 0 • R = 0, F = 1 • R = 1, F = 0 • R = (1 - a1) / (1 - a1a2), F = (1 - a2) / (1 - a1a2) F R
Stable Focus(Predator-Prey) r1(1 - a1) < -r2(1 - a2) r1 = 1 r2 = -1 a1 = 2 a2 = 1.9 r1 = 1 r2 = -1 a1 = 2 a2 = 2.1 F F R R
Stable Saddle-Node(Competition) a1 < 1, a2 < 1 r1 = 1 r2 = 1 a1 = 1.1 a2 = 1.1 r1 = 1 r2 = 1 a1 = .9 a2 = .9 Node Saddle point F F Principle of Competitive Exclusion R R
Coexistence • With N species, there are 2N equilibria, only one of which represents coexistence. • Coexistence is unlikely unless the species compete only weakly with one another. • Diversity in nature may result from having so many species from which to choose. • There may be coexisting “niches” into which organisms evolve. • Species may segregate spatially. • Purely deterministic (no randomness) • Purely endogenous (no external effects) • Purely homogeneous (every cell is equivalent) • Purely egalitarian (all species obey same equation) • Continuous time