Co-clustering directed graphs to discover asymmetries and directional communities
Top Cited Papers
- 21 October 2016
- journal article
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 113 (45) , 12679-12684
Abstract
Significance: This paper adds to the continuing and long-running interest in networks and network clustering. For directed networks, we propose the di-sim algorithm to capture asymmetries of connections and discover directional clusters. We illustrate this algorithm with three data examples: the Enron email network, the hyperlinked blog network during the 2004 US presidential election, and the chemical connections among the neurons in Caenorhabditis elegans . We identify informative and bottleneck nodes in all three networks. In particular, for the third example, di-sim finds bottleneck nodes that create a feedforward structure among clusters of nodes.Keywords
Funding Information
- NSF (DMS-1309998)
- NSF (DMS-1612456)
- ARO (W911NF1110114)
- ARO (W911NF1510423)
- NSF (DMS-1308877)
- NSF (SES-0835531 (CDI))
- NSF (DMS-1107000)
- NSF (CCF-0939370)
This publication has 12 references indexed in Scilit:
- Pseudo-likelihood methods for community detection in large sparse networksThe Annals of Statistics, 2013
- Point Process Modelling for Directed Interaction NetworksJournal of the Royal Statistical Society Series B: Statistical Methodology, 2013
- The Connectome of a Decision-Making Neural NetworkScience, 2012
- Stochastic blockmodels and community structure in networksPhysical Review E, 2011
- Community Structure in Directed NetworksPhysical Review Letters, 2008
- Network motifs: theory and experimental approachesNature Reviews Genetics, 2007
- The political blogosphere and the 2004 U.S. election2005
- Stochastic blockmodels: First stepsSocial Networks, 1983
- Direct Clustering of a Data MatrixJournal of the American Statistical Association, 1972
- Direct Clustering of a Data MatrixJournal of the American Statistical Association, 1972