Cantitate/Preț
Produs

The Mathematics of Finite Networks: An Introduction to Operator Graph Theory

Autor Michael Rudolph
en Limba Engleză Hardback – 11 mai 2022
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.
Citește tot Restrânge

Preț: 47720 lei

Preț vechi: 53618 lei
-11% Nou

Puncte Express: 716

Preț estimativ în valută:
9132 9522$ 7590£

Carte tipărită la comandă

Livrare economică 21 martie-04 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781107134430
ISBN-10: 1107134439
Pagini: 200
Dimensiuni: 157 x 235 x 24 mm
Greutate: 0.69 kg
Ediția:Nouă
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States

Cuprins

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.

Notă biografică


Descriere

Offers an exact, non-asymptotic approach to studying large-scale features of finite networks that arise in real applications.