The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
This collection of contributions originates from the well-established conference series "Fractal Geometry and Stochastics" which brings together researchers from different fields using concepts and methods from fractal geometry. Carefully selected papers from keynote and invited speakers are included, both discussing exciting new trends and results and giving a gentle introduction to some recent developments. The topics covered include Assouad dimensions and their connection to analysis, multifractal properties of functions and measures, renewal theorems in dynamics, dimensions and topology of random discrete structures, self-similar trees, p-hyperbolicity, phase transitions from continuous to discrete scale invariance, scaling limits of stochastic processes, stemi-stable distributions and fractional differential equations, and diffusion limited aggregation. Representing a rich source of ideas and a good starting point for more advanced topics in fractal geometry, the volume will appeal to both established experts and newcomers.
Topological data analysis (TDA) has emerged recently as a viable tool for analyzing complex data, and the area has grown substantially both in its methodologies and applicability. Providing a computational and algorithmic foundation for techniques in TDA, this comprehensive, self-contained text introduces students and researchers in mathematics and computer science to the current state of the field. The book features a description of mathematical objects and constructs behind recent advances, the algorithms involved, computational considerations, as well as examples of topological structures or ideas that can be used in applications. It provides a thorough treatment of persistent homology together with various extensions – like zigzag persistence and multiparameter persistence – and their applications to different types of data, like point clouds, triangulations, or graph data. Other important topics covered include discrete Morse theory, the Mapper structure, optimal generating cycles, as well as recent advances in embedding TDA within machine learning frameworks.
This volume contains the proceedings of the Stanford Symposium on Algebraic Topology: Applications and New Directions, held from July 23-27, 2012, at Stanford University, Stanford, California. The symposium was held in honor of Gunnar Carlsson, Ralph Cohen and Ib Madsen, who celebrated their 60th and 70th birthdays that year. It showcased current research in Algebraic Topology reflecting the celebrants' broad interests and profound influence on the subject. The topics varied broadly from stable equivariant homotopy theory to persistent homology and application in data analysis, covering topological aspects of quantum physics such as string topology and geometric quantization, examining homology stability in algebraic and geometric contexts, including algebraic -theory and the theory of operads.
Applied topology is a modern subject which emerged in recent years at a crossroads of many methods, all of them topological in nature, which were used in a wide variety of applications in classical mathematics and beyond. Within applied topology, discrete Morse theory came into light as one of the main tools to understand cell complexes arising in different contexts, as well as to reduce the complexity of homology calculations. The present book provides a gentle introduction into this beautiful theory. Using a combinatorial approach—the author emphasizes acyclic matchings as the central object of study. The first two parts of the book can be used as a stand-alone introduction to homology, the last two parts delve into the core of discrete Morse theory. The presentation is broad, ranging from abstract topics, such as formulation of the entire theory using poset maps with small fibers, to heavily computational aspects, providing, for example, a specific algorithm of finding an explicit homology basis starting from an acyclic matching. The book will be appreciated by graduate students in applied topology, students and specialists in computer science and engineering, as well as research mathematicians interested in learning about the subject and applying it in context of their fields.
The book discusses the potential of higher-order interactions to model real-world relational systems. Over the last decade, networks have emerged as the paradigmatic framework to model complex systems. Yet, as simple collections of nodes and links, they are intrinsically limited to pairwise interactions, limiting our ability to describe, understand, and predict complex phenomena which arise from higher-order interactions. Here we introduce the new modeling framework of higher-order systems, where hypergraphs and simplicial complexes are used to describe complex patterns of interactions among any number of agents. This book is intended both as a first introduction and an overview of the state of the art of this rapidly emerging field, serving as a reference for network scientists interested in better modeling the interconnected world we live in.
Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.
Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical computer science will welcome the new edition of this book.” - MAA Reviews Maintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating exercises. The new edition includes numerous updates to reflect the most recent developments and advances in discrete mathematics and the connections to other areas in mathematics, theoretical computer science, and statistical physics. Emphasizing the methodology and techniques that enable problem-solving, The Probabilistic Method, Fourth Edition begins with a description of tools applied to probabilistic arguments, including basic techniques that use expectation and variance as well as the more advanced applications of martingales and correlation inequalities. The authors explore where probabilistic techniques have been applied successfully and also examine topical coverage such as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Written by two well-known authorities in the field, the Fourth Edition features: Additional exercises throughout with hints and solutions to select problems in an appendix to help readers obtain a deeper understanding of the best methods and techniques New coverage on topics such as the Local Lemma, Six Standard Deviations result in Discrepancy Theory, Property B, and graph limits Updated sections to reflect major developments on the newest topics, discussions of the hypergraph container method, and many new references and improved results The Probabilistic Method, Fourth Edition is an ideal textbook for upper-undergraduate and graduate-level students majoring in mathematics, computer science, operations research, and statistics. The Fourth Edition is also an excellent reference for researchers and combinatorists who use probabilistic methods, discrete mathematics, and number theory. Noga Alon, PhD, is Baumritter Professor of Mathematics and Computer Science at Tel Aviv University. He is a member of the Israel National Academy of Sciences and Academia Europaea. A coeditor of the journal Random Structures and Algorithms, Dr. Alon is the recipient of the Polya Prize, The Gödel Prize, The Israel Prize, and the EMET Prize. Joel H. Spencer, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of New York University. He is the cofounder and coeditor of the journal Random Structures and Algorithms and is a Sloane Foundation Fellow. Dr. Spencer has written more than 200 published articles and is the coauthor of Ramsey Theory, Second Edition, also published by Wiley.
Homology is a powerful tool used by mathematicians to study the properties of spaces and maps that are insensitive to small perturbations. This book uses a computer to develop a combinatorial computational approach to the subject. The core of the book deals with homology theory and its computation. Following this is a section containing extensions to further developments in algebraic topology, applications to computational dynamics, and applications to image processing. Included are exercises and software that can be used to compute homology groups and maps. The book will appeal to researchers and graduate students in mathematics, computer science, engineering, and nonlinear dynamics.
This Element presents one of the most recent developments in network science in a highly accessible style. This Element will be of interest to interdisciplinary scientists working in network science, in addition to mathematicians working in discrete topology and geometry and physicists working in quantum gravity.
