The Mathematics of Finite Networks
An Introduction to Operator Graph Theory
Published on 25. May 2022
978-1-009-28783-8 (ISBN)
Description
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.
Reviews / Votes
'The tool provided in this book is potentially valuable in understanding the mathematical beauty of finite networks involved in many real-world applications.' Yilun Shang, zbMATHMore details
Language
English
Place of publication
Cambridge
United Kingdom
Illustrations
Worked examples or Exercises
File size
8,22 MB
ISBN-13
978-1-009-28783-8 (9781009287838)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
05/2022
Cambridge University Press
€88.40
Shipment within 15-20 days
Content
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.
