Author: Svante Janson
Publisher: John Wiley & Sons
ISBN: 1118030966
Category : Mathematics
Languages : en
Pages : 350
Book Description
A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references
Random Graphs
Author: Svante Janson
Publisher: John Wiley & Sons
ISBN: 1118030966
Category : Mathematics
Languages : en
Pages : 350
Book Description
A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references
Publisher: John Wiley & Sons
ISBN: 1118030966
Category : Mathematics
Languages : en
Pages : 350
Book Description
A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references
Higher Order Networks: An Introduction to Simplicial Complexes
Author: Ginestra Bianconi
Publisher: Cambridge University Press
ISBN: 1108726739
Category : Mathematics
Languages : en
Pages : 149
Book Description
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.
Publisher: Cambridge University Press
ISBN: 1108726739
Category : Mathematics
Languages : en
Pages : 149
Book Description
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.
Topological Signal Processing
Author: Michael Robinson
Publisher: Springer Science & Business Media
ISBN: 3642361048
Category : Technology & Engineering
Languages : en
Pages : 245
Book Description
Signal processing is the discipline of extracting information from collections of measurements. To be effective, the measurements must be organized and then filtered, detected, or transformed to expose the desired information. Distortions caused by uncertainty, noise, and clutter degrade the performance of practical signal processing systems. In aggressively uncertain situations, the full truth about an underlying signal cannot be known. This book develops the theory and practice of signal processing systems for these situations that extract useful, qualitative information using the mathematics of topology -- the study of spaces under continuous transformations. Since the collection of continuous transformations is large and varied, tools which are topologically-motivated are automatically insensitive to substantial distortion. The target audience comprises practitioners as well as researchers, but the book may also be beneficial for graduate students.
Publisher: Springer Science & Business Media
ISBN: 3642361048
Category : Technology & Engineering
Languages : en
Pages : 245
Book Description
Signal processing is the discipline of extracting information from collections of measurements. To be effective, the measurements must be organized and then filtered, detected, or transformed to expose the desired information. Distortions caused by uncertainty, noise, and clutter degrade the performance of practical signal processing systems. In aggressively uncertain situations, the full truth about an underlying signal cannot be known. This book develops the theory and practice of signal processing systems for these situations that extract useful, qualitative information using the mathematics of topology -- the study of spaces under continuous transformations. Since the collection of continuous transformations is large and varied, tools which are topologically-motivated are automatically insensitive to substantial distortion. The target audience comprises practitioners as well as researchers, but the book may also be beneficial for graduate students.
Fractal Geometry and Stochastics VI
Author: Uta Freiberg
Publisher: Springer Nature
ISBN: 3030596494
Category : Mathematics
Languages : en
Pages : 307
Book Description
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.
Publisher: Springer Nature
ISBN: 3030596494
Category : Mathematics
Languages : en
Pages : 307
Book Description
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.
Geometric and Topological Inference
Author: Jean-Daniel Boissonnat
Publisher: Cambridge University Press
ISBN: 1108419399
Category : Computers
Languages : en
Pages : 247
Book Description
A rigorous introduction to geometric and topological inference, for anyone interested in a geometric approach to data science.
Publisher: Cambridge University Press
ISBN: 1108419399
Category : Computers
Languages : en
Pages : 247
Book Description
A rigorous introduction to geometric and topological inference, for anyone interested in a geometric approach to data science.
Simplicial Complexes of Graphs
Author: Jakob Jonsson
Publisher: Springer Science & Business Media
ISBN: 3540758585
Category : Mathematics
Languages : en
Pages : 376
Book Description
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory.
Publisher: Springer Science & Business Media
ISBN: 3540758585
Category : Mathematics
Languages : en
Pages : 376
Book Description
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory.
Organized Collapse: An Introduction to Discrete Morse Theory
Author: Dmitry N. Kozlov
Publisher: American Mathematical Society
ISBN: 1470464551
Category : Mathematics
Languages : en
Pages : 312
Book Description
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.
Publisher: American Mathematical Society
ISBN: 1470464551
Category : Mathematics
Languages : en
Pages : 312
Book Description
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.
Handbook of Discrete and Computational Geometry
Author: Csaba D. Toth
Publisher: CRC Press
ISBN: 1351645919
Category : Computers
Languages : en
Pages : 2354
Book Description
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.
Publisher: CRC Press
ISBN: 1351645919
Category : Computers
Languages : en
Pages : 2354
Book Description
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.
Introduction to Random Graphs
Author: Alan Frieze
Publisher: Cambridge University Press
ISBN: 1107118506
Category : Mathematics
Languages : en
Pages : 483
Book Description
The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.
Publisher: Cambridge University Press
ISBN: 1107118506
Category : Mathematics
Languages : en
Pages : 483
Book Description
The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.
Configuration Spaces
Author: Filippo Callegaro
Publisher: Springer
ISBN: 3319315803
Category : Mathematics
Languages : en
Pages : 385
Book Description
This book collects the scientific contributions of a group of leading experts who took part in the INdAM Meeting held in Cortona in September 2014. With combinatorial techniques as the central theme, it focuses on recent developments in configuration spaces from various perspectives. It also discusses their applications in areas ranging from representation theory, toric geometry and geometric group theory to applied algebraic topology.
Publisher: Springer
ISBN: 3319315803
Category : Mathematics
Languages : en
Pages : 385
Book Description
This book collects the scientific contributions of a group of leading experts who took part in the INdAM Meeting held in Cortona in September 2014. With combinatorial techniques as the central theme, it focuses on recent developments in configuration spaces from various perspectives. It also discusses their applications in areas ranging from representation theory, toric geometry and geometric group theory to applied algebraic topology.