no code implementations • 18 May 2016 • Eyal En Gad, Akshay Gadde, A. Salman Avestimehr, Antonio Ortega
A new sampling algorithm is proposed, which sequentially selects the graph nodes to be sampled, based on an aggressive search for the boundary of the signal over the graph.
no code implementations • 8 May 2016 • Akshay Gadde, Eyal En Gad, Salman Avestimehr, Antonio Ortega
Our main result is to show that, under certain conditions, sampling the labels of a vanishingly small fraction of nodes (a number sub-linear in $n$) is sufficient for exact community detection even when $D(a, b)<1$.