# Bipartite Stochastic Block Models with Tiny Clusters

Stefan Neumann

We study the problem of finding clusters in random bipartite graphs. We present a simple two-step algorithm which provably finds even tiny clusters of size $O(n^\epsilon)$, where $n$ is the number of vertices in the graph and $\epsilon > 0$... (read more)

PDF Abstract

No code implementations yet. Submit your code now