Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-28T14:16:35.946Z Has data issue: false hasContentIssue false

7 - Space-time phases

Published online by Cambridge University Press:  05 June 2014

Robert S. MacKay
Affiliation:
University of Warwick
Robin Ball
Affiliation:
University of Warwick
Vassili Kolokoltsov
Affiliation:
University of Warwick
Robert S. MacKay
Affiliation:
University of Warwick
Get access

Summary

Abstract

Complexity science is the study of systems with many interdependent components. One of the main concepts is “emergence”: the whole may be greater than the sum of the parts. The objective of this chapter is to put emergence on a firm mathematical foundation in the context of dynamics of large networks. Both stochastic and deterministic dynamics are treated. To minimise technicalities, attention is restricted to dynamics in discrete time, in particular to probabilistic cellular automata and coupled map lattices. The key notion is space-time phases: probability distributions for state as a function of space and time that can arise in systems that have been running for a long time. What emerges from a complex dynamic system is one or more space-time phases. The amount of emergence in a space-time phase is its distance from the set of product distributions over space, using an appropriate metric. A system exhibits strong emergence if it has more than one space-time phase. Strong emergence is the really interesting case.

This chapter is based on MSc or PhD courses given at Warwick in 2006/7, Paris in April 2007, Warwick in Spring 2009 and Autumn 2009, and Brussels in Autumn 2010. It was written up during study leave in 2010/11 at the Université Libre de Bruxelles, to whom I am grateful for hospitality, and finalised in 2012.

The chapter provides an introduction to the theory of space-time phases, via some key examples of complex dynamic system.

I am most grateful to Dayal Strub for transcribing the notes into LaTeX and for preparing the figures.

Type
Chapter
Information
Complexity Science
The Warwick Master's Course
, pp. 387 - 426
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Adler, R. 1998. Symbolic dynamics and Markov partitions. Bull. Amer. Math. Soc., 35, 1–56.CrossRefGoogle Scholar
[2] Baesens, C., and MacKay, R. S. 1997. Exponential localization of linear response in networks with exponentially decaying coupling, Nonlinearity 10, 931–940.CrossRefGoogle Scholar
[3] Bardet, J. B., and Keller, G. 2006. Phase transitions in a piecewise expanding coupled map lattice with linear nearest neighbour coupling. Non-linearity, 19(9), 2193.Google Scholar
[4] Bennett, C. H., and Grinstein, G. 1985. Role of irreversibility in stabilizing complex and nonergodic behavior in locally interacting discrete systems. Phys. Rev. Lett., 55, 657–660.CrossRefGoogle ScholarPubMed
[5] Bricmont, J., and Kupiainen, A. 1996. High temperature expansions and dynamical systems. Comm. Math. Phys., 178, 703–732.CrossRefGoogle Scholar
[6] Bunimovich, L.A., and Sinaĭ, Ya. G. 1988. Spacetime chaos in coupled map lattices. Nonlinearity, 1(4), 491–516.CrossRefGoogle Scholar
[7] Diakonova, M., and MacKay, R. S. 2011. Mathematical examples of space-time phase. Int J. Bifurcat. Chaos, 21(08), 2297–2304.CrossRefGoogle Scholar
[8] Dobrushin, R. L. 1971. Markov processes with a large number of locally interacting components: existence of a limit process and its ergodicity. Probl. Inf. Transm., 7, 149–164.Google Scholar
[9] Durrett, R. 1984. Oriented percolation in two dimensions. Ann. Probab., 12(4), 999–1040.CrossRefGoogle Scholar
[10] Gielis, G., and MacKay, R. S. 2000. Coupled map lattices with phase transition. Nonlinearity, 13(3), 867–888.CrossRefGoogle Scholar
[11] Kantorovich, L. V., and Rubinstein, G. Sh. 1958. On a space of completely additive functions (in Russian). Vestnik Leningrad Univ., 13(7), 52–59.Google Scholar
[12] Lebowitz, J.L., Maes, C., and Speer, E. R. 1990. Statistical mechanics of probabilistic cellular automata. J. Stat. Phys., 59, 117–170.CrossRefGoogle Scholar
[13] Liggett, T. M. 2005. Interacting Particle Systems. Classics in Mathematics. Berlin: Springer-Verlag. Reprint of the 1985 original.CrossRefGoogle Scholar
[14] MacKay, R. S. 1996. Dynamics of networks: features which persist from the uncoupled limit. Pages 81–104 of: Strien, S. J. Van, and Verduyn Lunel, S. M. (eds.), Stochastic and Spatial Structures of Dynamical Systems. North Holland.Google Scholar
[15] MacKay, R. S. 2005. Indecomposable coupled map lattices with non-unique phase. Pages 65–94 of: Chazottes, J. R., and Fernandez, B. (eds.), Dynamics ofCoupled Map Lattices and of Related Spatially Extended Systems. Lecture Notes in Physics 671. Springer.Google Scholar
[16] MacKay, R. S. 2008. Nonlinearity in complexity science. Nonlinearity, 21(12), T273-T281.CrossRefGoogle Scholar
[17] MacKay, R. S. 2011. Robustness of Markov processes on large networks. J. Difference Equ. Appl., 17(8), 1155–1167.CrossRefGoogle Scholar
[18] Maes, C. 1993. Coupling interacting particle systems. Rev. Math. Phys., 5(3), 457–475.CrossRefGoogle Scholar
[19] Pesin, Ya. B., and Sinaĭ, Ya. G. 1991. Space-time chaos in chains of weakly interacting hyperbolic mappings. Adv. Sov. Math, 3, 165–198.Google Scholar
[20] Robinson, R. C. 1999. Dynamical Systems, 2nd edn. Studies in Advanced Mathematics. Boca Raton, FL: CRC Press.Google Scholar
[21] Ruelle, D. 1978. Thermodynamic Formalism. Addison-Wesley.Google Scholar
[22] Sakaguchi, H. 1988. Phase transitions in coupled Bernoulli maps. Prog. Theor. Phys., 80, 7–12.CrossRefGoogle Scholar
[23] Sinaĭ, Ya. G. 1972. Gibbs measures in ergodic theory. Russ. Math. Surv., 28, 21–64.Google Scholar
[24] Stavskaya, O. N. 1973. Gibbs invariant measures for Markov chains on finite lattices with local interaction (in Russian). Matematicheskii Sbornik, 134(3), 402–419.Google Scholar
[25] Toom, A. L. 1980. Stable and attractive trajectories in multicomponent systems. Pages 549–576 of: Dobrushin, R. L., and Sinai, Ya. G. (eds), Multicomponent Random Systems, Adv. Probab. Related Topics6.Google Scholar
[26] Toom, A.L., Vasilyev, N.B., Stavskaya, O.N., Mityushin, L. G., Kurdyumov, G.L., and Pirogov, S. A. 1990. Discrete local Markov systems. Pages 1–182 of: Dobrushin, R. L., Kryukov, V. L., and Toom, A. L. (eds), Stochastic Cellular Systems: Ergodicity, memory, morphogenesis. Manchester: Manchester University Press.Google Scholar
[27] Vasilyev, N. B., Petrovskaya, M. B., and Piatetski-Shapiro, I.I. 1969. Simulation of voting with random errors (in Russian). Automatica i Telemekh, 10, 103–7.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×