Module identification in bipartite and directed networks

Details Module identification in bipartite and directed networks Module identification in bipartite and directed networks

2007-01-12

arxiv.org/abs/physics/0701151v2

Phys. Rev. E 76, 036102 (2007)

Physics

Data Analysis, Statistics and Probability

Scientific paper

10.1103/PhysRevE.76.036102

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 non-overlapping sets, and the links must have one end node from each set. Directed unipartite networks only have one type of nodes, but links have an origin and an end. We show that directed unipartite networks can be conviniently represented as bipartite networks for module identification purposes. We report a novel approach especially suited for module detection in bipartite networks, and define a set of random networks that enable us to validate the new approach.

Affiliated with

Also associated with

No associations

Rating

Module identification in bipartite and directed networks 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 Module identification in bipartite and directed networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Module identification in bipartite and directed networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218609