@misc{Latapy2006,
	title = {Basic Notions for the Analysis of Large Affiliation Networks / Bipartite   Graphs},
	author = {Matthieu Latapy and Clemence Magnien and Nathalie {Del Vecchio}},
	url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0611631},
	year = {2006},
	biburl = {http://www.bibsonomy.org/bibtex/27f814b543b13745a148730de900f466c/chriskoerner},
	description = {Citebase - Basic Notions for the Analysis of Large Affiliation Networks / Bipartite   Graphs},
	abstract = {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.},
	keywords = {imported }
}