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

In many real-world applications such as social network analysis and online
advertising/marketing, one of the most important and popular problems is called influence …

Triangle counting is a building block for a wide range of graph applications. Traditional
wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle …

Streaming graph analysis is gaining importance in various fields due to the natural
dynamicity in many real graph applications. However, approximately counting triangles in …

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

Given a stream of edge additions and deletions, how can we estimate the count of triangles
in it? If we can store only a subset of the edges, how can we obtain unbiased estimates with …

A great variety of complex systems ranging from user interactions in communication
networks to transactions in financial markets can be modeled as temporal graphs, which …

We consider space-efficient single-pass estimation of the number of butterflies, a
fundamental bipartite graph motif, from a massive bipartite graph stream where each edge …

We study the fundamental problem of butterfly (ie,(2, 2)-bicliques) counting in bipartite
streaming graphs. Similar to triangles in unipartite graphs, enumerating butterflies is crucial …

Bipartite graph models the relationship between two different sets of entities. Such graph
data become more dynamic and are organized as stream with duplicate edges in real-word …