RAGE - A rapid graphlet enumerator for large networks

Computer Networks

Volumn 56, Issue 2, 2012, Pages 810-819

  Marcus, D ^a   Shavitt, Y ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Efficient algorithms; Graphlets; Network motifs; Subgraph enumeration

Indexed keywords

AUTONOMOUS SYSTEMS; COMPLEX NETWORKS; COUNTING NETWORKS; EFFICIENT ALGORITHM; GRAPHLETS; INTERNET TOPOLOGIES; LARGE NETWORKS; NETWORK MOTIFS; NETWORK SIZE; REAL-WORLD GRAPHS; SUBGRAPH ENUMERATION;

INTERNET; TOPOLOGY; WEB BROWSERS;

ALGORITHMS;

EID: 84856046088     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2011.08.019     Document Type: Article

References (29)

1. N. Pržulj, D.G. Corneil, and I. Jurisica Modeling interactome: scale-free or geometric? Bioinformatics 20 2004 3508 3515 (Pubitemid 40136786)
2. 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 (Pubitemid 35231534)
3. R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen-Orr, I. Ayzenshtat, M. Sheffer, and U. Alon Superfamilies of evolved and designed networks Science 303 2004 1538 1542 (Pubitemid 38314428)
4. D. Feldman, Y. Shavitt, Automatic large scale generation of internet PoP level maps, in: GLOBECOM, 2008, pp. 2426-2431.
5. L. Becchetti, P. Boldi, C. Castillo, A. Gionis, Effcient semi-streaming algorithms for local triangle counting in massive graphs, in: ACM SIGCOMM international conference on Knowledge discovery and data mining (KDD), 2008, pp. 16-24.
6. D. Hales, and S. Arteconi Motifs in evolving cooperative networks look like protein structure networks The Journal of Networks and Heterogeneous Media 3 2 2008 239 249 (special issue of ECCS'07)
7. T. Milenkovic, and N. Przulj Uncovering biological network function via graphlet degree signatures Social Networks 6 2008 257 273
8. M. Gonen, Y. Shavitt, Approximating the number of network motifs, in: WAW'09: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, 2009, pp. 13-24.
9. M. Latapy Main-memory triangle computations for very large (sparse (power-law)) graphs Theoretical Computer Science 407 1-3 2008 458 473
10. V. Batagelj, and A. Mrvar A subquadratic triad census algorithm for large sparse networks with small maximum degree Social Networks 23 2001 237 243 (Pubitemid 33633652)
11. R. Itzhack, Y. Mogilevski, and Y. Louzoun An optimal algorithm for counting network motifs Physica A 381 2007 482 490 (Pubitemid 46829642)
12. N. Shervashidze, S. Vishwanathan, T. Petri, K. Mehlhorn, K. Borgwardt, Efficient graphlet kernels for large graph comparison, in: 12th International Conference on Artificial Intelligence and Statistics (AISTATS), Society for Artificial Intelligence and Statistics, Clearwater Beach, Fl, USA, April 16-18, 2009, 2009.
13. S. Wernicke Efficient detection of network motifs IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 3 2006 347 359 (Pubitemid 44950084)
14. A. Stoica, C. Prieur, Structure of neighborhoods in a large social network, in: International Conference on Computational Science and Engineering (SocialCom), 2009.
15. M. Gonen, D. Ron, and Y. Shavitt Counting stars and other small subgraphs in sublinear time SIAM Journal on Discrete Mathematics 25 3 2011 1365 1411
16. A. Dhamdhere, and C. Dovrolis Ten years in the evolution of the internet ecosystem Proceedings of the 8th ACM SIGCOMM Conference on Internet measurement, IMC'08 2008 ACM 183 196
17. L. Gao On inferring autonomous system relationships in the Internet IEEE/ACM Transactions on Networking 9 6 2001 733 745 (Pubitemid 34099653)
18. Y. Shavitt, E. Shir, U. Weinsberg, Near-deterministic inference of AS relationships, in: ConTEL, 2009.
19. R. Cohen, D. Raz, The Internet dark matter - on the missing links in the AS connectivity map, in: IEEE Infocom 2006, Barcelona, Spain, 2006.
20. M. Gonen, and Y. Shavitt Approximating the number of network motifs Internet Mathematics 6 3 2009 349 372
21. Y. Shavitt, and E. Shir DIMES: Let the internet measure itself ACM SIGCOMM Computer Communication Review 35 2005 71 74 (Pubitemid 46323482)
22. S. Wernicke, and F. Rasche FANMOD: a tool for fast network motif detection Bioinformatics 22 2006 1152 1153
23. C. Jin, C.J. Qian, S. Jamin, Inet: Internet topology generator, , 2000.
24. P. Erdos, and A. Renyi On random graphs I Publicationes Mathematicae (Debrecen) 6 1959 290 297
25. X. Dimitropoulos, D. Krioukov, G. Riley, K. Claffy, Revealing the autonomous system taxonomy: the machine learning approach, in: Passive and Active Measurement (PAM) Workshop, 2006.
26. L. Breiman Random forests Machine Learning 45 2001 5 32 (Pubitemid 32933532)
27. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, and I.H. Witten The weka data mining software: an update SIGKDD Explorer Newsletter 11 2009 10 18
28. M. Sumner, E. Frank, and M. Hall Speeding up logistic model tree induction 9th European Conference on Principles and Practice of Knowledge Discovery in Databases 2005 Springer 675 683
29. R. Quinlan C4.5: Programs for Machine Learning 1993 Morgan Kaufman Publishers, San Mateo, CA