Jump to ContentJump to Main Navigation
The Structure of Complex NetworksTheory and Applications$
Users without a subscription are not able to see the full content.

Ernesto Estrada

Print publication date: 2011

Print ISBN-13: 9780199591756

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199591756.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 21 July 2019

Metric and topological structure of networks

Metric and topological structure of networks

Chapter:
(p.47) 3 Metric and topological structure of networks
Source:
The Structure of Complex Networks
Author(s):

Ernesto Estrada

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199591756.003.0003

This chapter explains the following concepts: shortest path distance, average path length, diameter, and the small-world properties of networks in networks; resistance distance in networks; and the mathematical relationship between this concept and those of the pseudo-inverse of the Laplacian matrix, random walks, and electric resistance. Then, a generalisation of both metric concepts is carried out through the presentation of the forest distance. Next, the chapter analyses topological properties of networks starting with the concept of network planarity. The embeddings of nonplanar networks into surfaces is then considered, and the concepts of genus and skewness of the network presented. This is followed by some illustrative examples of the problem of planarity in some real-world scenarios. The chapter ends with a short discussion of the topic of embedding complex networks into hyperbolic spaces.

Keywords:   graph metrics, shortest path distance, resistance distance, forest distance, planarity, embeddings, hyperbolic spaces, network thickness

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .