Times cited: 528

Guimera, R, Sales-Pardo, M, Amaral, LAN.
Phys. Rev. E 76 , art. no. 036102 (2007).

Download PDF or Visit journal

Modularity is one of the most prominent properties of real-world complex networks. Here, we address the issue of module identification in two important classes of networks: bipartite networks and directed unipartite networks. Nodes in bipartite networks are divided into two nonoverlapping sets, and the links must have one end node from each set. Directed unipartite networks only have one type of node, but links have an origin and an end. We show that directed unipartite networks can be conveniently represented as bipartite networks for module identification purposes. We report on an approach especially suited for module detection in bipartite networks, and we define a set of random networks that enable us to validate the approach.

  • Bipartite modularity - Bipartmod: Module identification in bipartite and directed networks. Given a bipartite (or directed) network, the program returns a partition into groups of the nodes in one of the sets of nodes (the 'actors' or the 'teams').
  • Network C libraries - RGraph: Source code of the C libraries for a variety of network calculations, including community finding using simulated annealing, network cartography, and link and network reliability.