Motifs, cliques, communities

Sergey N. Dorogovtsev

in Lectures on Complex Networks

Published in print February 2010 | ISBN: 9780199548927
Published online May 2010 | e-ISBN: 9780191720574 | DOI:

Series: Oxford Master Series in Physics

Motifs, cliques, communities

More Like This

Show all results sharing this subject:

  • Mathematical and Statistical Physics


Show Summary Details


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

Chapter.  5870 words.  Illustrated.

Subjects: Mathematical and Statistical Physics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.