2 citations · 2 across the 4 of their papers we have counts for
1 paper · 2 filters
Julien Chhor, Parker Knight
We consider the problem of detecting a community of densely connected vertices in a high-dimensional bipartite graph of size n1×n2. Under the null hypothesis, the observ…