We consider the problem of counting motifs in bipartite affiliation networks, such as author-
paper, user-product, and actor-movie relations. We focus on counting the number of …

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 …

A bipartite graph is a graph that consists of two disjoint sets of vertices and only edges
between vertices from different vertex sets. In this paper, we study the counting problems of …

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 …

Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich
body of work on this problem, in varying streaming and distributed models, yet all these …

If we cannot store all edges in a dynamic graph, which edges should we store to estimate
the triangle count accurately? Counting triangles (ie, cliques of size three) is a fundamental …

Triangle listing is an important topic in many practical applications. We have observed that
this problem has not yet been studied systematically in the context of batch-dynamic graphs …

This is an auxiliary file containing references to all the papers mentioned in our WWW 2019
tutorial. For each paper, we give a short 1-2 sentence description of the relevance to the field …

Triangle counts of massive graphs can provide important information regarding the structure
of the networks these graphs model. Exact triangle counting can be expensive and thus …

We present a sublinear time algorithm that allows one to sample multiple edges from a
distribution that is pointwise $\epsilon $-close to the uniform distribution, in an\emph …