Knowledge and Information Systems

, Volume 50, Issue 3, pp 689–722

Graphlet decomposition: framework, algorithms, and applications

  • Nesreen K. Ahmed
  • Jennifer Neville
  • Ryan A. Rossi
  • Nick G. Duffield
  • Theodore L. Willke
Regular paper

DOI: 10.1007/s10115-016-0965-5

Cite this article as:
Ahmed, N.K., Neville, J., Rossi, R.A. et al. Knowl Inf Syst (2017) 50: 689. doi:10.1007/s10115-016-0965-5

Abstract

From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks. While graphlets have witnessed a tremendous success and impact in a variety of domains, there has yet to be a fast and efficient framework for computing the frequencies of these subgraph patterns. However, existing methods are not scalable to large networks with billions of nodes and edges. In this paper, we propose a fast, efficient, and parallel framework as well as a family of algorithms for counting k-node graphlets. The proposed framework leverages a number of theoretical combinatorial arguments that allow us to obtain significant improvement on the scalability of graphlet counting. For each edge, we count a few graphlets and obtain the exact counts of others in constant time using the combinatorial arguments. On a large collection of \(300+\) networks from a variety of domains, our graphlet counting strategies are on average \(460{\times }\) faster than existing methods. This brings new opportunities to investigate the use of graphlets on much larger networks and newer applications as we show in the experiments. To the best of our knowledge, this paper provides the largest graphlet computations to date.

Keywords

Graphlet Motif Graph mining Graph kernel Classification Graph features Higher-order graph statistics Biological networks Visual graph analytics 

Copyright information

© Springer-Verlag London 2016

Authors and Affiliations

  • Nesreen K. Ahmed
    • 1
  • Jennifer Neville
    • 2
  • Ryan A. Rossi
    • 3
  • Nick G. Duffield
    • 4
  • Theodore L. Willke
    • 1
  1. 1.Parallel Computing LabIntel CorporationSanta ClaraUSA
  2. 2.Department of Computer SciencePurdue UniversityWest LafayetteUSA
  3. 3.Palo Alto Research Center (PARC)Palo AltoUSA
  4. 4.Department of Electrical and Computer EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations