Read more
"Since the early eighteenth century, the theory of networks and graphs has matured into an indispensable tool for describing countless real-world phenomena. However, the study of large-scale features of a network often requires unrealistic limits, such as taking the network size to infinity or assuming a continuum. These asymptotic and analytic approaches can significantly diverge from real or simulated networks when applied at the finite scales of real-world applications. This book offers an approach to overcoming these limitations by introducing operator graph theory, an exact, non-asymptotic set of tools combining graph theory with operator calculus. The book is intended for mathematicians, physicists, and other scientists interested in discrete finite systems and their graph-theoretical description, and in delineating the abstract algebraic structures that characterise such systems. All the necessary background on graph theory and operator calculus is included for readers to understand the potential applications of operator graph theory"--
List of contents
Preface: 1. Introduction; Part I. Operator Graph Theory: 2. Classical graph theory:The mathematical description of networks; 3. Operator calculus:The mapping between vector spaces; 4. Operator graph theory:The mathematics of finite networks; Part II. Applications: 5. Generating graphs; 6. Measuring graphs; 7. Transforming graphs; Afterthought; Bibliography; Index of notations; Index.
About the author
Michael Rudolph is a mathematical physicist of the French National Centre for Scientific Research at the Institut Denis Poisson. His research includes graph theory and classical number theory, and is directed towards understanding physical reality from an inherently finite discrete perspective, both mathematically and philosophically.
Summary
The study of large-scale features of a network often requires approximations that may result in significant divergence from the finite scales of real applications. This book offers an approach to overcoming these limitations by introducing an exact, non-asymptotic set of tools combining graph theory with operator calculus.
Foreword
Offers an exact, non-asymptotic approach to studying large-scale features of finite networks that arise in real applications.
