The Shortest Path to Network Geometry
A Practical Guide to Basic Models and Applications
Part of Elements in the Structure and Dynamics of Complex Networks
- Authors:
- M. Ángeles Serrano, University of Barcelona, University of Barcelona Institute of Complex Systems (UBICS) and Catalan Institution for Research and Advanced Studies (ICREA)
- Marián Boguñá, University of Barcelona and University of Barcelona Institute of Complex Systems (UBICS)
- Date Published: January 2022
- availability: Available
- format: Paperback
- isbn: 9781108791083
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: January 2022
- format: Paperback
- isbn: 9781108791083
- length: 75 pages
- dimensions: 228 x 152 x 4 mm
- weight: 0.1kg
- availability: Available
Table of Contents
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×