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 …

Counting and enumeration of local topological structures, such as triangles, is an important
task for analyzing large real‐life networks. For instance, triangle count in a network is used …

Subgraph isomorphism counting is an important problem on graphs, as many graph-based
tasks exploit recurring subgraph patterns. Classical methods usually boil down to a …

Hypergraphs naturally represent group interactions, which are omnipresent in many
domains: collaborations of researchers, co-purchases of items, joint interactions of proteins …

In this paper, we study a new graph learning problem: learning to count subgraph
isomorphisms. Different from other traditional graph learning problems such as node …

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 …

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 …

Link prediction is a fundamental problem in social network analysis. There exist a variety of
techniques for link prediction which applies the similarity measures to estimate proximity of …

Using different methods for laying out a graph can lead to very different visual appearances,
with which the viewer perceives different information. Selecting a “good” layout method is …

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 …