Butterfly Counting in Bipartite Networks

@article{SaneiMehri2018ButterflyCI,
  title={Butterfly Counting in Bipartite Networks},
  author={Seyed-Vahid Sanei-Mehri and Ahmet Erdem Sariy{\"u}ce and Srikanta Tirthapura},
  journal={Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining},
  year={2018}
}
  • Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura
  • Published 2018
  • Computer Science, Mathematics
  • Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
  • 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 occurrences of a "butterfly", a complete 2x2 biclique, the simplest cohesive higher-order structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large… CONTINUE READING
    Efficient Butterfly Counting for Large Bipartite Networks
    1
    Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks
    13
    Counting Butterfies from a Large Bipartite Graph Stream
    FLEET: Butterfly Estimation from a Bipartite Graph Stream
    2
    Parallel Algorithms for Butterfly Computations
    4
    Parallel Clique Counting and Peeling Algorithms
    5
    Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)
    Hypergraph motifs

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Triadic Measures on Graphs: The Power of Wedge Sampling
    93
    Colorful triangle counting and a MapReduce implementation
    127