While maintaining the lucidity of the first edition, Discrete Chaos, Second Edition: With Applications in Science and Engineering now includes many recent results on global stability, bifurcation, chaos, and fractals.
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions.
This volume presents the state-of-the-art in selected topics across modern nuclear physics, covering fields of central importance to research and illustrating their connection to many different areas of physics.
Aimed at graduate students and researchers in enumerative combinatorics, this book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective.
This book presents collaborative research presented by experts in the field of nonlinear science provides the reader with contemporary, cutting-edge, research works that bridge the gap between theory and device realizations of nonlinear phenomena.
Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems.
The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.
This book provides a comprehensive review of complex networks from three different domains, presents novel methods for analyzing them, and highlights applications with accompanying case studies.
This book contains recent contributions to the fields of rigidity and symmetry with two primary focuses: to present the mathematically rigorous treatment of rigidity of structures and to explore the interaction of geometry, algebra and combinatorics.
Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks.
Key problems and conjectures have played an important role in promoting the development of Ramsey theory, a field where great progress has been made during the past two decades, with some old problems solved and many new problems proposed.
50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects.
Discrete Event Simulation is a process-oriented text/reference that utilizes an eleven-step model to represent the simulation process from problem formulation to implementation and documentation.
Modern Applications of Graph Theory discusses many cutting-edge applications of graph theory, such as traffic networks, navigable networks and optimal routing for emergency response, placement of electric vehicle charging stations, and graph-theoretic methods in molecular epidemiology.
The book collects contributions from experts worldwide addressing recent scholarship in social network analysis such as influence spread, link prediction, dynamic network biclustering, and delurking.
This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses.
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words.
Basics of Ramsey Theory serves as a gentle introduction to Ramsey theory for students interested in becoming familiar with a dynamic segment of contemporary mathematics that combines ideas from number theory and combinatorics.
This book provides a comprehensive review of complex networks from three different domains, presents novel methods for analyzing them, and highlights applications with accompanying case studies.
This contributed book has a comprehensive collection of 17 carefully curated chapters that delve into the latest advancements in fixed-point theory and its diverse applications.
Around the globe, there is an increasingly urgent need to provide opportunities for learners to embrace complexity; to develop the many skills and habits of mind that are relevant to today's complex and interconnected world; and to make learning more connected to our rapidly changing workplace and society.
This book provides two conceptual frameworks for further investigation of map literacy and fills in a gap in map literacy studies, addressing the distinction between reference maps and thematic maps and the varying uses of quantitative map literacy (QML) within and between the two.
From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems.
Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians.
