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.
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: