000 03552nam a22005535i 4500
001 978-0-387-49879-9
003 DE-He213
005 20161121231206.0
007 cr nn 008mamaa
008 100301s2008 xxu| s |||| 0|eng d
020 _a9780387498799
_9978-0-387-49879-9
024 7 _a10.1007/978-0-387-49879-9
_2doi
050 4 _aQA299.6-433
072 7 _aPBK
_2bicssc
072 7 _aMAT034000
_2bisacsh
082 0 4 _a515
_223
100 1 _aMortveit, Henning S.
_eauthor.
245 1 3 _aAn Introduction to Sequential Dynamical Systems
_h[electronic resource] /
_cby Henning S. Mortveit, Christian M. Reidys.
264 1 _aBoston, MA :
_bSpringer US,
_c2008.
300 _aXII, 248 p. 73 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aWhat is a Sequential Dynamical System? -- A Comparative Study -- Graphs, Groups, and Dynamical Systems -- Sequential Dynamical Systems over Permutations -- Phase-Space Structure of SDS and Special Systems -- Graphs, Groups, and SDS -- Combinatorics of Sequential Dynamical Systems over Words -- Outlook.
520 _aSequential Dynamical Systems (SDS) are a class of discrete dynamical systems which significantly generalize many aspects of systems such as cellular automata, and provide a framework for studying dynamical processes over graphs. This text is the first to provide a comprehensive introduction to SDS. Driven by numerous examples and thought-provoking problems, the presentation offers good foundational material on finite discrete dynamical systems which leads systematically to an introduction of SDS. Techniques from combinatorics, algebra and graph theory are used to study a broad range of topics, including reversibility, the structure of fixed points and periodic orbits, equivalence, morphisms and reduction. Unlike other books that concentrate on determining the structure of various networks, this book investigates the dynamics over these networks by focusing on how the underlying graph structure influences the properties of the associated dynamical system. This book is aimed at graduate students and researchers in discrete mathematics, dynamical systems theory, theoretical computer science, and systems engineering who are interested in analysis and modeling of network dynamics as well as their computer simulations. Prerequisites include knowledge of calculus and basic discrete mathematics. Some computer experience and familiarity with elementary differential equations and dynamical systems are helpful but not necessary.
650 0 _aMathematics.
650 0 _aComputer science
_xMathematics.
650 0 _aComputer simulation.
650 0 _aMathematical analysis.
650 0 _aAnalysis (Mathematics).
650 0 _aDynamics.
650 0 _aErgodic theory.
650 0 _aApplied mathematics.
650 0 _aEngineering mathematics.
650 1 4 _aMathematics.
650 2 4 _aAnalysis.
650 2 4 _aDynamical Systems and Ergodic Theory.
650 2 4 _aSimulation and Modeling.
650 2 4 _aApplications of Mathematics.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aReidys, Christian M.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387306544
856 4 0 _uhttp://dx.doi.org/10.1007/978-0-387-49879-9
912 _aZDB-2-SMA
950 _aMathematics and Statistics (Springer-11649)
999 _c509911
_d509911