Jump to ContentJump to Main Navigation
Lectures on Complex Networks$
Users without a subscription are not able to see the full content.

Sergey Dorogovtsev

Print publication date: 2010

Print ISBN-13: 9780199548927

Published to Oxford Scholarship Online: May 2010

DOI: 10.1093/acprof:oso/9780199548927.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: 23 July 2019

Motifs, cliques, communities

Motifs, cliques, communities

Chapter:
(p.73) 10 Motifs, cliques, communities
Source:
Lectures on Complex Networks
Author(s):

Sergey N. Dorogovtsev

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

This chapter discusses subgraphs in complex networks. First, it considers ‘building blocks’ of networks-motifs subgraphs that are present in many copies in a network. It focuses on the statistics of cliques and motifs in complex networks. It also discusses ways to detect relatively weakly-interconnected modules in a network (communities) and introduces the notion of modularity.

Keywords:   motifs, subgraphs, modularity, cliques, communities, hierarchical organization

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 .