Jun 22, 2015 · We propose a simple spectral algorithm, Diagonal Deletion SVD, which recovers the partition at a nearly optimal edge density.
We consider a bipartite stochastic block model on vertex sets V_1 and V_2, with planted partitions in each, and ask at what densities efficient algorithms ...
The results give the best known bounds for the clause density at which solutions can be found efficiently in these models as well as showing a barrier to ...
We study this bipartite block model in detail, first locating a sharp threshold for detection and then studying the performance of spectral algorithms. Our main ...
We consider a bipartite stochastic block model on vertex sets V1V1 and V2V2, with planted partitions in each, and ask at what densities efficient algorithms ...
Jul 19, 2016 · Author: Laura Florescu, Will Perkins.
Sep 27, 2016 · There are efficient algorithms for exactly recovering the true colors, provided that |p − q| is large enough as n → ∞. Laura Florescu and Will ...
May 24, 2016 · Our first result is an analogous sharp threshold for detection in the bipartite stochastic block model at p = (δ − 1)−2(n1n2)−1/2, with an ...
Finding matched node communities in a bipartite network is a necessary task for network analysis in many applications, especially in biomedical sciences. For ...
People also ask
What is the degree distribution of the stochastic block model?
What is the stochastic block model for clustering?
Mar 7, 2021 · Even for the simplest case of a stochastic blockmodel without covariates, our spectral method is faster by several orders of magnitude. For ...