Approximating the number of network motifs

Internet Mathematics

Volumn 6, Issue 3, 2009, Pages 349-372

  Gonen, Mira ^a   Shavitt, Yuval ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 82955188307     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2009.10390645     Document Type: Article

References (50)

1. R. Albert and A.-L. Barabási. “Topology of Evolving Networks: Local Events and Universality.” Physical Review Letters 85:24 (2000), 5234–5237.
2. N. Alon and S. Gutner. “Balanced Families of Perfect Hash Functions and Their Applications.” In Automata, Languages and Programming: 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9–13, 2007, Proceedings, Lecture Notes in Computer Science 4596, pp. 435–446. Berlin: Springer, 2007.
3. N. Alon, R. Yuster, and U. Zwick. “Color Coding.” Journal of the ACM 42 (1995), 844–856.
4. N. Alon, R. Yuster, and U. Zwick. “Finding and Counting Given Length Cycles.” Algorithmica 17 (1997), 209–223.
5. N. Alon, P. Dao, I. Hajirasouliha, F. Hormozdiari, and S. C. Sahinalp. “Biomolecular Network Motif Counting and Discovery by Color Coding.” Bioinformatics 1 (2008), 1–9.
6. V. Arvind and V. Raman. “Approximation Algorithms for Some Parameterized Counting Problems.” In Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, Lecture Notes in Computer Science 2518, pp. 453–464. Berlin: Springer, 2002.
7. S. Bar, M. Gonen, and A. Wool. “An Incremental Super-linear Preferential Internet Topology Model.” In Passive and Active Network Measurement: 5th International Workshop, PAM 2004, Antibes Juan-les-Pins, France, April 19– 20, 2004, Proceedings, Lecture Notes in Computer Science 3015, pp. 53–62. Berlin: Springer, 2004.
8. S. Bar, M. Gonen, and A. Wool. “A Geographic Directed Preferential Internet Topology Model. In Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp. 325–328. Washington, DC: IEEE Computer Society, 2005.
9. P. Barford, A. Bestavros, J. Byers, and M. Crovella. “On the Marginal Utility of Network Topology Measurements.” In Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, pp. 5–17. New York: ACM, 2001.
10. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. “Efficient Semistreaming Algorithms for Local Triangle Counting in Massive Graphs.” In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 16–24. New York: ACM, 2008.
11. G. Bianconi and A. L. Barabási. “Competition and Multiscaling in Evolving Networks.” Europhysics Letters 54:4 (2001), 436–442.
12. G. Bianconi and A. Capocci. “Number of Loops of Size h in Growing Scale-Free Networks.” Physical Review Letters 90 (2003), 078701.
13. G. Bianconi and M. Marsili. “Loops of Any Size and Hamilton Cycles in Random Scale-FreeNetworks.” Journal of Statistical Mechanics (2005), P06005.
14. G. Bianconi and M. Marsili. “Number of Cliques in Random Scale-Free Network Ensembles.” Physica D 224 (2006), 1–6.
15. R. X. Brunet and I. M. Sokolov. “Evolving Networks with Disadvantaged Long-Range Connections.” Physical Review E 66 (2002), 026118.
16. T. Bu and D. Towsley. “On Distinguishing between Internet Power-Law Topology Generators.” In Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 638–647. Washington, DC: IEEE Computer Society, 2002.
17. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. “The Origin of Power Laws in Internet Topologies Revisited.” In Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 608–617. Washington, DC: IEEE Computer Society, 2002.
18. B. Dost, T. Shlomi, N. Gupta, E. Ruppin, V. Bafna, and R. Sharan. “QNet: A Tool for Querying Protein Interaction Networks.” In Research in Computational Molecular Biology: 11th Annual International Conference, RECOMB 2007, Oakland, CA, USA, April 21–25, 2007, Proceedings, Lecture Notes in Computer Science 4453, pp. 1–15. New York: Springer, 2007.
19. R. Duke, H. Lefmann, and V. Rödl. “A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.” SIAM Journal on Computing 24:3 (1995), 598–620.
20. C. Faloutsos, M. Faloutsos, and P. Faloutsos. “On Power-Law Relationships of the Internet Topology.” In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 251–260. New York: ACM, 1999.
21. Dima Feldman and Yuval Shavitt. “Automatic Large Scale Generation of Internet PoP Level Maps.” In Proceedings of the IEEE Global Telecommunications Conference, pp. 1–6. Washington, DC: IEEE Computer Socitey, 2008.
22. Mira Gonen and Yuval Shavitt. “Approximating the Number of Network Motifs.” In Algorithms and Models for the Web-Graph: 6th International Workshop, WAW 2009, Barcelona, Spain, February 12–13, 2009, Proceedings, Lecture Notes in Computer Science 5427, pp. 13–24. New York: Springer, 2009.
23. M. Gonen, D. Ron, and Y. Shavitt. “Counting Stars and Other Small Subgraphs in Sublinear Time.” In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 99–116. Philadelphia: SIAM, 2010.
24. M. Gordon, E. A. Livneh, R. Y. Pinter, and E. Rubin. “Elucidating Protein Function Using Graphlet Degree Vectors in Protein–Protein Interactions Networks.” To appear, 2010.
25. R. Govindan and H. Tangmunarunki. “Heuristics for Internet Map Discovery.” In Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1371–1380. Washington, DC: IEEE Computer Society, 2000.
26. J. Grochow and M. Kellis. “Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking.” In Research in Computational Molecular Biology: 11th Annual International Conference, RECOMB 2007, Oakland, CA, USA, April 21–25, 2007, Proceedings, Lecture Notes in Computer Science 4453, pp. 92–106. New York: Springer, 2007.
27. D. Hales and S. Arteconi. “Motifs in Evolving Cooperative Networks Look like Protein Structure Networks.” Special Issue of ECCS’07 in the Journal of Networks and Heterogeneous Media 3:2 (2008), 239–249.
28. F. Hormozdiari, P. Berenbrink, N. Przulj, and S. C. Sahinalp. “Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution.” PLoS: Computational Biology 3:7 (2007), e118.
29. R. Itzhack, Y. Mogilevski, and Y. Louzoun. “An Optimal Algorithm for Counting Network Motifs.” Physica A 381 (2007), 482–490.
30. R. Karp and M. Luby. “Monte-Carlo Algorithms for Enumeration and Reliability Problems.” In Proceedings of the Twenty-Fourth Annual Symposium on Foundations of Computer Science, pp. 56–64. Washington, DC: IEEE Computer Society, 1983.
31. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon. “Efficient Sampling Algorithm for Estimating Subgraph Concentrations and Detecting Network Motifs.” Bioinformatics 20:11 (2004), 1746–1758.
32. A Lakhina, J. W. Byers, M. Crovella, and P. Xie. “Sampling Biases in IP Topology Measurments.” In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 332–341. Washington, DC: IEEE Computer Society, 2003.
33. X. Li and G. Chen. “A Local-World Evolving Network Model.” Physica A 328 (2003), 274–286.
34. E. Marinari, G. Semerjian, and V. Van Kerrebroeck. “Finding Long Cycles in Graphs.” Physical Review E 75:6 (2007), 066708.
35. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. “Network Motifs: Simple Building Blocks of Complex Networks.” Science 298 (2002), 824–827.
36. N. Przulj. “Biological Network Comparison Using Graphlet Degree Distribution.” Bioinformatics 23:2 (2007), e177–e183.
37. N. Przulj, D. G. Corneil, and I. Jurisica. “Modeling Interactome: Scale-Free or Geometric?” Bioinformatics 20:18 (2004), 3508–3515.
38. H. Reittu and I. Norros. “On the Power Law Random Graph Model of the Internet.” Performance Evaluation 55, 2004.
39. G. Sagie and A. Wool. “A Clustering Approach for Exploring the Internet Structure.” In Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, pp. 149–152. Washington, DC: IEEE Computer Society, 2004.
40. J. Scott, T. Ideker, R. Karp, and R. Sharan. “Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks.” In Research in Computational Molecular Biology: 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14–18, 2005, Proceedings, Lecture Notes in Computer Science 3500, pp. 1–13. New York: Springer, 2005.
41. Yuval Shavitt and Eran Shir. “DIMES: Let the Internet Measure Itself.” ACM SIGCOMM Computer Communication Review 35 (2005), 71–74.
42. T. Shlomi, D. Segal, and E. Ruppin. “QPath: A Method for Querying Pathways in a Protein–Protein Interaction Network.” Bioinformatics 7 (2006), 199.
43. G. Siganos, S. L. Tauro, and M. Faloutsos. “Jellyfish: A Conceptual Model for the AS Internet Topology.” Journal of Communications and Networks 8 (2006), 339–350.
44. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz. “Characterizing the Internet Hierarchy from Multiple Vantage Points.” In Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 618–627. Washington, DC: IEEE Computer Society, 2002.
45. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. “Network Topology Generators: Degree Based vs. Structural.” In Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 147–159. New York: ACM, 2002.
46. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. “A Simple Conceptual Model for the Internet Topology.” In Proceedings of the IEEE Conference on Global Telecommunications, pp. 1667–1671. Washington, DC: IEEE Computer Society, 2001.
47. V. Van Kerrebroeck and E. Marinari. “Ranking by Loops: A New Approach to Categorization.” Physical Review Letters 101 (2008), 098701.
48. S. Wernicke. “Efficient Detection of Network Motifs.” IEEE/ACM Transactions on Computational Biology and Bioinformatics 3:4 (2006), 347–359.
49. W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker. “Scaling Phenomena in the Internet: Critically Examining Criticality.” Proceedings of the National Academy of Sciences of the United States of America 99 (2002), 2573–2580.
50. J. Winick and S. Jamin. “INET-3.0: Internet Topology Generator.” Technical Report UM-CSE-TR-456-02, Department of EECS, University of Michigan, 2002.