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 (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 12 August 2020

Centrality measures

Centrality measures

(p.121) 7 Centrality measures
The Structure of Complex Networks

Ernesto Estrada

Oxford University Press

This chapter discusses the concept of node centrality in complex networks and explains the concepts of degree, Katz, eigenvector, subgraph, returnability, PageRank, vibrational, closeness, and betweenness centrality. In all cases, the centrality measures are analysed for undirected and directed networks, and several variations of some of the indices are also discussed, such as the shortest path, random walk, flow, and communicability betweenness. Examples of the application of these concepts in simple and real-world networks are provided.

Keywords:   degree centrality, katz centrality, eigenvector centrality, subgraph centrality, node returnability, pageRank centrality, vibrational centrality, closeness centrality, betweenness centralities

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 .