206 citations · 225 across the 3 of their papers we have counts for
4 papers
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
Tai Qin, Karl Rohe
Spectral clustering is a fast and popular algorithm for finding clusters in networks. Recently, Chaudhuri et al. (2012) and Amini et al.(2012) proposed inspired variations on the a…
The blessing of transitivity in sparse and stochastic networks
Karl Rohe, Tai Qin
The interaction between transitivity and sparsity, two common features in empirical networks, implies that there are local regions of large sparse networks that are dense. We call…
The Highest Dimensional Stochastic Blockmodel with a Regularized Estimator
Karl Rohe, Tai Qin, Haoyang Fan
In the high dimensional Stochastic Blockmodel for a random network, the number of clusters (or blocks) K grows with the number of nodes N. Two previous studies have examined the st…
Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim
Karl Rohe, Tai Qin, Bin Yu
Directed graphs have asymmetric connections, yet the current graph clustering methodologies cannot identify the potentially global structure of these asymmetries. We give a spectra…