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 core of several
network analysis methodologies, such as network motifs and graphlet-based metrics, which …
network analysis methodologies, such as network motifs and graphlet-based metrics, which …
Escape: Efficiently counting all 5-vertex subgraphs
A Pinar, C Seshadhri, V Vishal - … of the 26th international conference on …, 2017 - dl.acm.org
Counting the frequency of small subgraphs is a fundamental technique in network analysis
across various domains, most notably in bioinformatics and social networks. The special …
across various domains, most notably in bioinformatics and social networks. The special …
Pangolin: An efficient and flexible graph mining system on cpu and gpu
There is growing interest in graph pattern mining (GPM) problems such as motif counting.
GPM systems have been developed to provide unified interfaces for programming …
GPM systems have been developed to provide unified interfaces for programming …
Triest: Counting local and global triangles in fully dynamic streams with fixed memory size
“Ogni lassada xe persa.” 1--Proverb from Trieste, Italy. We present trièst, a suite of one-pass
streaming algorithms to compute unbiased, low-variance, high-quality approximations of the …
streaming algorithms to compute unbiased, low-variance, high-quality approximations of the …
Tricore: Parallel triangle counting on gpus
Exact triangle counting algorithm enumerates the triangles in a graph by identifying the
common neighbors of two vertices of each edge. In this work, we present TriCore, a scalable …
common neighbors of two vertices of each edge. In this work, we present TriCore, a scalable …
A general framework for estimating graphlet statistics via random walk
Graphlets are induced subgraph patterns and have been frequently applied to characterize
the local topology structures of graphs across various domains, eg, online social networks …
the local topology structures of graphs across various domains, eg, online social networks …
MOSS-5: A fast method of approximating counts of 5-node graphlets in large graphs
Counting 3-, 4-, and 5-node graphlets in graphs is important for graph mining applications
such as discovering abnormal/evolution patterns in social and biology networks. In addition …
such as discovering abnormal/evolution patterns in social and biology networks. In addition …
Fast change point detection on dynamic social networks
A number of real world problems in many domains (eg sociology, biology, political science
and communication networks) can be modeled as dynamic networks with nodes …
and communication networks) can be modeled as dynamic networks with nodes …
Waddling random walk: Fast and accurate mining of motif statistics in large graphs
G Han, H Sethu - 2016 IEEE 16th International Conference on …, 2016 - ieeexplore.ieee.org
Algorithms for mining very large graphs, such as those representing online social networks,
to discover the relative frequency of small subgraphs within them are of high interest to …
to discover the relative frequency of small subgraphs within them are of high interest to …
Mining graphlet counts in online social networks
X Chen, JCS Lui - ACM Transactions on Knowledge Discovery from Data …, 2018 - dl.acm.org
Counting subgraphs is a fundamental analysis task for online social networks (OSNs). Given
the sheer size and restricted access of OSN, efficient computation of subgraph counts is …
the sheer size and restricted access of OSN, efficient computation of subgraph counts is …