The Shortest Path to Network Geometry
A Practical Guide to Basic Models and Applications
Published on 12. January 2022
978-1-108-85750-5 (ISBN)
Description
Real networks comprise from hundreds to millions of interacting elements and permeate all contexts, from technology to biology to society. All of them display non-trivial connectivity patterns, including the small-world phenomenon, making nodes to be separated by a small number of intermediate links. As a consequence, networks present an apparent lack of metric structure and are difficult to map. Yet, many networks have a hidden geometry that enables meaningful maps in the two-dimensional hyperbolic plane. The discovery of such hidden geometry and the understanding of its role have become fundamental questions in network science giving rise to the field of network geometry. This Element reviews fundamental models and methods for the geometric description of real networks with a focus on applications of real network maps, including decentralized routing protocols, geometric community detection, and the self-similar multiscale unfolding of networks by geometric renormalization.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Illustrations
Worked examples or Exercises
File size
4,91 MB
ISBN-13
978-1-108-85750-5 (9781108857505)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
M. Angeles Serrano | Marian Boguna
The Shortest Path to Network Geometry
A Practical Guide to Basic Models and Applications
Book
01/2022
Cambridge University Press
€24.00
Shipment within 15-20 days
Persons
Content
1. From networks to maps; 2. Geometric models for static topologies; 3. Mapping real networks; 4. Mesoscale organization and community detection; 5. Self-similarity and renormalization; 6. Navigability; 7. Geometry of weighted, multiplex, and growing networks; 8. Conclusions; References.
