Co-clustering for directed graphs: an algorithm, a model, and some asymptotics

Thursday, March 29, 2012 - 12:00pm - 12:45pm
Keller 3-180
Karl Rohe (University of Wisconsin, Madison)
Although the network clustering literature has focused on undirected networks, many networks are directed. For example, communication networks contain asymmetric relationships, representing the flow of information from one person to another. This talk will (1) demonstrate that co-clustering, instead of clustering, is more natural for many directed graphs, (2) propose a spectral algorithm and a statistical model for co-clustering, (3) show some asymptotic results, and (4) present a preliminary analysis of a citation network from Arxiv. Of key interest is the discovery of bottleneck nodes that transmit information between clusters of papers. This is joint work with Professor Bin Yu at UC Berkeley.
MSC Code: