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 …
Motif discovery algorithms in static and temporal networks: A survey
A Jazayeri, CC Yang - Journal of Complex Networks, 2020 - academic.oup.com
Motifs are the fundamental components of complex systems. The topological structure of
networks representing complex systems and the frequency and distribution of motifs in these …
networks representing complex systems and the frequency and distribution of motifs in these …
Efficient graphlet counting for large networks
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 …
and meaningful characterization of networks at both the global macro-level as well as the …
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 …
Network sampling: From static to streaming graphs
Network sampling is integral to the analysis of social, information, and biological networks.
Since many real-world networks are massive in size, continuously evolving, and/or …
Since many real-world networks are massive in size, continuously evolving, and/or …
Path sampling: A fast and provable method for estimating 4-vertex subgraph counts
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 …
Hypergraph motifs: concepts, algorithms, and discoveries
Hypergraphs naturally represent group interactions, which are omnipresent in many
domains: collaborations of researchers, co-purchases of items, joint interactions of proteins …
domains: collaborations of researchers, co-purchases of items, joint interactions of proteins …
Neural subgraph counting with Wasserstein estimator
Subgraph counting is a fundamental graph analysis task which has been widely used in
many applications. As the problem of subgraph counting is NP-complete and hence …
many applications. As the problem of subgraph counting is NP-complete and hence …
Counting graphlets: Space vs time
Counting graphlets is a well-studied problem in graph mining and social network analysis.
Recently, several papers explored very simple and natural approaches based on Monte …
Recently, several papers explored very simple and natural approaches based on Monte …
A fast and provable method for estimating clique counts using turán's theorem
S Jain, C Seshadhri - Proceedings of the 26th international conference …, 2017 - dl.acm.org
Clique counts reveal important properties about the structure of massive graphs, especially
social networks. The simple setting of just 3-cliques (triangles) has received much attention …
social networks. The simple setting of just 3-cliques (triangles) has received much attention …