Approximating the Number of Network Motifs

Abstract The World Wide Web, the Internet, coupled biological and chemical systems, neural networks, and social interacting species are only a few examples of systems comprising a large number of highly interconnected dynamical units. These networks contain characteristic patterns, network motifs, that occur far more often than in randomized networks with the same degree sequence. Several algorithms have been suggested for counting or detecting the number of occurrences of network motifs as trees and bounded treewidth subgraphs of size O(log n), at most 7 for some motifs. In addition, local motif counting, counting the number of motifs in which a node participates, was recently suggested as a method of classifying nodes in the network. The premise is that the distribution of motifs in which a node participates is an indication of its function in the network. Therefore, local counting of network motifs provides a major challenge. However, no such practical algorithm exists other than local counting of triangles. We present several algorithms with time complexity O(((3e) k · n · |E| · log )/∊2) that approximate for every vertex the number of occurrences of the motif in which the vertex participates, for k-length cycles and k-length cycles with a chord, where k = O(log n), and algorithms with time complexity O((n · |E| · log )/∊2 + |E|2 · log n + |E| · n log n) that approximate for every vertex the number of noninduced occurrences of the motif in which the vertex participates for all motifs of size four. In addition, we show algorithms that approximate the total number of occurrences of these network motifs when no efficient algorithm exists. Some of our algorithms use the “color-coding” technique.

[1]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Michalis Faloutsos,et al.  Jellyfish: A conceptual model for the as Internet topology , 2006, Journal of Communications and Networks.

[3]  Valery Van Kerrebroeck,et al.  Ranking vertices or edges of a network by loops: a new approach. , 2008, Physical review letters.

[4]  Sebastian Wernicke,et al.  Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[6]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[7]  Walter Willinger,et al.  Scaling phenomena in the Internet: Critically examining criticality , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Azer Bestavros,et al.  On the marginal utility of network topology measurements , 2001, IMW '01.

[9]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Guilhem Semerjian,et al.  Finding long cycles in graphs , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Igor Jurisica,et al.  Modeling interactome: scale-free or geometric? , 2004, Bioinform..

[12]  G. Bianconi,et al.  Number of loops of size h in growing scale-free networks. , 2002, Physical review letters.

[13]  Valery Van Kerrebroeck,et al.  Ranking by Loops: a new approach to categorization , 2008 .

[14]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.

[15]  Avishai Wool,et al.  An Incremental Super-Linear Preferential Internet Topology Model: Extended Abstract , 2004, PAM.

[16]  Ginestra Bianconi,et al.  Number of cliques in random scale-free network ensembles , 2006 .

[17]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[18]  Vojtech Rödl,et al.  A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph , 1995, SIAM J. Comput..

[19]  Roded Sharan,et al.  QPath: a method for querying pathways in a protein-protein interaction network , 2006, BMC Bioinformatics.

[20]  I M Sokolov,et al.  Evolving networks with disadvantaged long-range connections. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Süleyman Cenk Sahinalp,et al.  Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution , 2006, Systems Biology and Computational Proteomics.

[22]  Yoram Louzoun,et al.  An optimal algorithm for counting network motifs , 2007 .

[23]  Roded Sharan,et al.  QNet: A Tool for Querying Protein Interaction Networks , 2007, RECOMB.

[24]  Ilkka Norros,et al.  On the power-law random graph model of massive data networks , 2004, Perform. Evaluation.

[25]  M. Marsili,et al.  Loops of any size and Hamilton cycles in random scale-free networks , 2005, cond-mat/0502552.

[26]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[27]  Xiang Li,et al.  A local-world evolving network model , 2003 .

[28]  Michalis Faloutsos,et al.  A simple conceptual model for the Internet topology , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[29]  Noga Alon,et al.  Balanced Families of Perfect Hash Functions and Their Applications , 2007, ICALP.

[30]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[31]  Roded Sharan,et al.  Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks , 2006, J. Comput. Biol..

[32]  Natasa Przulj,et al.  Biological network comparison using graphlet degree distribution , 2007, Bioinform..

[33]  A. Wool,et al.  A clustering approach for exploring the Internet structure , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[34]  Joshua A. Grochow,et al.  Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking , 2007, RECOMB.

[35]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[36]  Sugih Jamin,et al.  Inet-3.0: Internet Topology Generator , 2002 .

[37]  Noga Alon,et al.  Color-coding , 1995, JACM.

[38]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[39]  Yuval Shavitt,et al.  Approximating the Number of Network Motifs , 2009, WAW.

[40]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[41]  Luca Becchetti,et al.  Efficient semi-streaming algorithms for local triangle counting in massive graphs , 2008, KDD.

[42]  Dana Ron,et al.  Counting stars and other small subgraphs in sublinear time , 2010, SODA '10.

[43]  Avishai Wool,et al.  A geographic directed preferential Internet topology model , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[44]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[45]  Noga Alon,et al.  Biomolecular network motif counting and discovery by color coding , 2008, ISMB.

[46]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[47]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[48]  Venkatesh Raman,et al.  Approximation Algorithms for Some Parameterized Counting Problems , 2002, ISAAC.

[49]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[50]  Yuval Shavitt,et al.  Automatic Large Scale Generation of Internet PoP Level Maps , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[51]  David Hales,et al.  Motifs in evolving cooperative networks look like protein structure networks , 2008, Networks Heterog. Media.