Efficient Counting of Network Motifs

Counting network motifs has an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of Internet Topology and WWW graphs counting the number of motifs becomes prohibitive. Devising efficient motif counting algorithms thus becomes an impo...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE 30th International Conference on Distributed Computing Systems Workshops pp. 92 - 98
Main Authors Marcus, Dror, Shavitt, Yuval
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Algorithm design and analysis
Approximation algorithms
Approximation methods
Complexity theory
efficient algorithms
graphlets
network motifs
Partitioning algorithms
Peer to peer computing
Runtime
Online AccessGet full text

Cover

More Information
Summary:Counting network motifs has an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of Internet Topology and WWW graphs counting the number of motifs becomes prohibitive. Devising efficient motif counting algorithms thus becomes an important goal. In this paper, we present efficient counting algorithms for 4-nodemotifs. We show how to efficiently count the total number of each type of motif, and the number of motifs adjacent to a node. We further present a new algorithm for node position-aware motif counting, namely partitioning the motif count by the node position in the motif. Since our algorithm is based on motifs, which are non-induced we also show how to calculate the count of induced motifs given the non-induced motif count. Finally, we report on initial implementation performance result using evaluation on a large-scale graph.
ISBN:9781424474714
142447471X
ISSN:1545-0678
DOI:10.1109/ICDCSW.2010.41