Henning Mortveit, Christian Reidys0387306544, 9780387306544
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.
Table of contents :
Preface……Page 5
Contents……Page 8
What is a Sequential Dynamical System?……Page 12
A Comparative Study……Page 34
Graphs, Groups, and Dynamical Systems……Page 49
Sequential Dynamical Systemsover Permutations……Page 78
Phase-Space Structure of SDS andSpecial Systems……Page 138
Graphs, Groups, and SDS……Page 173
Combinatorics of Sequential DynamicalSystems over Words……Page 193
Outlook……Page 221
References……Page 245
Index……Page 253
Reviews
There are no reviews yet.