Counting Butterfies from a Large Bipartite Graph Stream

Date
2018-01-01
Authors
Sanei-Mehri, Seyed-Vahid
Zhang, Yu
Sariyuce, Ahmet
Tirthapura, Srikanta
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Computer Science
Organizational Unit
Journal Issue
Series
Abstract

We consider the estimation of properties on massive bipartite graph streams, where each edge represents a connection between entities in two different partitions. We present sublinear-space one-pass algorithms for accurately estimating the number of butterflies in the graph stream. Our estimates have provable guarantees on their quality, and experiments show promising tradeoffs between space and accuracy. We also present extensions to sliding windows. While there are many works on counting subgraphs within unipartite graph streams, our work seems to be one of the few to effectively handle bipartite graph streams.

Description

This is a pre-print of the article Sanei-Mehri, Seyed-Vahid, Yu Zhang, Ahmet Erdem Sariyuce, and Srikanta Tirthapura. "Counting Butterfies from a Large Bipartite Graph Stream." arXiv preprint arXiv:1812.03398 (2018). Posted with permission.

Keywords
Citation
DOI
Source
Collections