Graphlet Decomposition: Framework, Algorithms, and Applications

06/13/2015
by   Nesreen K. Ahmed, et al.
0

From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks at both the global macro-level as well as the local micro-level. While graphlets have witnessed a tremendous success and impact in a variety of domains, there has yet to be a fast and efficient approach for computing the frequencies of these subgraph patterns. However, existing methods are not scalable to large networks with millions of nodes and edges, which impedes the application of graphlets to new problems that require large-scale network analysis. To address these problems, we propose a fast, efficient, and parallel algorithm for counting graphlets of size k=3,4-nodes that take only a fraction of the time to compute when compared with the current methods used. The proposed graphlet counting algorithms leverages a number of proven combinatorial arguments for different graphlets. For each edge, we count a few graphlets, and with these counts along with the combinatorial arguments, we obtain the exact counts of others in constant time. On a large collection of 300+ networks from a variety of domains, our graphlet counting strategies are on average 460x faster than current 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 as well as the largest systematic investigation on over 300+ networks from a variety of domains.

READ FULL TEXT

page 28

page 29

page 30

page 31

research
02/17/2020

A Fast Counting Method for 6-motifs with Low Connectivity

A k-motif (or graphlet) is a subgraph on k nodes in a graph or network. ...
research
01/06/2017

Estimation of Graphlet Statistics

Graphlets are induced subgraphs of a large network and are important for...
research
10/23/2020

Heterogeneous Graphlets

In this paper, we introduce a generalization of graphlets to heterogeneo...
research
12/29/2016

Motifs in Temporal Networks

Networks are a fundamental tool for modeling complex systems in a variet...
research
08/16/2023

DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting

Subgraph counting is the problem of counting the occurrences of a given ...
research
04/12/2018

Fast Counting in Machine Learning Applications

We propose scalable methods to execute counting queries in machine learn...
research
10/29/2019

A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

Computing subgraph frequencies is a fundamental task that lies at the co...

Please sign up or login with your details

Forgot password? Click here to reset