Co-clustering for Directed Graphs; the Stochastic Co-Blockmodel and a Spectral Algorithm

Details Co-clustering for Directed Graphs; the Stochastic Co-Blockmodel and a Spectral Algorithm Co-clustering for Directed Graphs; the Stochastic Co-Blockmodel and a Spectral Algorithm

2012-04-10

arxiv.org/abs/1204.2296v1

Statistics

Machine Learning

Tech Report at UW Madison Statistics Dept

Scientific paper

Communities of highly connected actors form an essential feature in the structure of several empirical directed and undirected networks. However, compared to the amount of research on clustering for undirected graphs, there is relatively little understanding of clustering in directed networks. This paper extends the spectral clustering algorithm to directed networks in a way that co-clusters or bi-clusters the rows and columns of a graph Laplacian. Co-clustering leverages the increased complexity of asymmetric relationships to gain new insight into the structure of the directed network. To understand this algorithm and to study its asymptotic properties in a canonical setting, we propose the Stochastic Co-Blockmodel to encode co-clustering structure. This is the first statistical model of co-clustering and it is derived using the concept of stochastic equivalence that motivated the original Stochastic Blockmodel. Although directed spectral clustering is not derived from the Stochastic Co-Blockmodel, we show that, asymptotically, the algorithm can estimate the blocks in a high dimensional asymptotic setting in which the number of blocks grows with the number of nodes. The algorithm, model, and asymptotic results can all be extended to bipartite graphs.

Affiliated with

Also associated with

No associations

Rating

Co-clustering for Directed Graphs; the Stochastic Co-Blockmodel and a Spectral Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Co-clustering for Directed Graphs; the Stochastic Co-Blockmodel and a Spectral Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Co-clustering for Directed Graphs; the Stochastic Co-Blockmodel and a Spectral Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716701