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.
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.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
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.
Inhaltsangabe
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.