Basic Notions for the Analysis of Large Affiliation Networks / Bipartite Graphs
| dc.creator | Latapy, Matthieu | |
| dc.creator | Magnien, Clemence | |
| dc.creator | Del Vecchio, Nathalie | |
| dc.date | 2006-11-24 | |
| dc.date.accessioned | 2026-07-07T07:31:28Z | |
| dc.date.available | 2026-07-07T07:31:28Z | |
| dc.description | Many real-world complex networks actually have a bipartite nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despite the fact that many ad-hoc tools have been designed for the study of special cases, very few exist to analyse (describe, extract relevant information) such networks in a systematic way. We propose here an extension of the most basic notions used nowadays to analyse classical complex networks to the bipartite case. To achieve this, we introduce a set of simple statistics, which we discuss by comparing their values on a representative set of real-world networks and on their random versions. | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0611631 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0611631 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118765 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Basic Notions for the Analysis of Large Affiliation Networks / Bipartite Graphs | |
| dc.type | text |