Show Summary Details

p. 807. Digging deeper into networkslocked

  • Guido Caldarelli
  •  and Michele Catanzaro

Abstract

‘Digging deeper into networks’ shows that to capture the more subtle structure of networks one has to find measures that describe the surroundings of a node — degree distribution is not enough. Characteristics and measurements discussed are assortative and disassortative networks, ego networks, clustering coefficient, betweenness centrality of a node, communities or modules in networks, motifs, and edge betweenness. Although a simplification, the graph representation is still capable of capturing many relevant features of a system. The graph provides plenty of information and more details arise when more complex measurements are performed. Generally, real-world networks deviate from their random counterparts, suggesting the existence of some kind of built-in order and self-organization.

Access to the complete content on Very Short Introductions online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can't find the answer there, please contact us.