RAGE - A rapid graphlet enumerator for large networks

D. Marcus*, Y. Shavitt

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Counting network graphlets (and motifs) was shown to have an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of the Internet topology and WWW graphs, counting the number of graphlets becomes prohibitive for graphlets of size 4 and above. Devising efficient graphlet counting algorithms thus becomes an important goal. In this paper, we present efficient counting algorithms for 4-node graphlets. We show how to efficiently count the total number of each type of graphlet, and the number of graphlets adjacent to a node. We further present a new algorithm for node position-aware graphlet counting, namely partitioning the graphlet count by the node position in the graphlet. Since our algorithms are based on non-induced graphlet count, we also show how to calculate the count of induced graphlets given the non-induced count. We implemented our algorithms on a set of both synthetic and real-world graphs. Our evaluation shows that the algorithms are scalable and perform up to 30 times faster than the state-of-the-art. We then apply the algorithms on the Internet Autonomous Systems (AS) graph, and show how fast graphlet counting can be leveraged for efficient and scalable classification of the ASes that comprise the Internet. Finally, we present RAGE, a tool for rapid graphlet enumeration available online.

Original languageEnglish
Pages (from-to)810-819
Number of pages10
JournalComputer Networks
Issue number2
StatePublished - 2 Feb 2012


  • Efficient algorithms
  • Graphlets
  • Network motifs
  • Subgraph enumeration


Dive into the research topics of 'RAGE - A rapid graphlet enumerator for large networks'. Together they form a unique fingerprint.

Cite this