MARC Record from harvard_bibliographic_metadata

LEADER: 02788nam a22003378a 4500
001 011378477-5
005 20140910154233.0
008 061218s2008 nyua b 001 0 eng
015 $aGBA6A5821$2bnb
016 7 $a013629162$2Uk
020 $a9780387306544 (hbk.)
020 $a0387306544 (hbk.)
035 0 $aocm77256542
040 $aUKM$cUKM$dOHX$dBAKER$dBTCTA$dYDXCP
082 04 $a515.39$222
090 $aQA614.8$b.M668 2008
100 1 $aMortveit, Henning S.
245 13 $aAn introduction to sequential dynamical systems /$cHenning S. Mortveit, Christian M. Reidys.
260 $aNew York ;$aLondon :$bSpringer,$cc2008.
300 $axii, 248 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references (p. [237]-244) and index.
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 $aDifferentiable dynamical systems.
650 0 $aSequential analysis.
650 0 $aComputational complexity.
650 0 $aComputer simulation.
650 0 $aMathematics.
700 1 $aReidys, Christian M.
988 $a20080205
906 $0OCLC