Computer Science – Social and Information Networks
Scientific paper
2011-04-22
Computer Science
Social and Information Networks
Scientific paper
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such graphs as most existing measures and methods are suited to classical graphs. A usual but limited approach consists in deriving 1-mode graphs (called projections) from the underlying bipartite structure, though it causes important loss of information and data storage issues. We introduce here internal links and pairs as a new notion useful for such analysis: it gives insights on the information lost by projecting the bipartite graph. We illustrate the relevance of theses concepts on several real-world instances illustrating how it enables to discriminate behaviors among various cases when we compare them to a benchmark of random networks. Then, we show that we can draw benefit from this concept for both modeling complex networks and storing them in a compact format.
Allali Oussama
Latapy Matthieu
Magnien Clémence
Tabourier Lionel
No associations
LandOfFree
Internal links and pairs as a new tool for the analysis of bipartite complex 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 Internal links and pairs as a new tool for the analysis of bipartite complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Internal links and pairs as a new tool for the analysis of bipartite complex networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-330668