Comparing Overlapping Properties of Real Bipartite Networks

Fabien Tarissan 1
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Many real-world networks lend themselves to the use of graphs for analysing and modelling their structure. But such a simple representation has proven to miss some important and non trivial properties hidden in the bipartite structure of the networks. Recent papers have shown that overlapping properties seem to be present in bipartite networks and that it could explain better the properties observed in simple graphs. This work intends to investigate this question by studying two proposed metrics to account for overlapping structures in bipartite networks. The study, conducted on four dataset stemming from very different contexts (computer science, juridical science and social science), shows that the most popular metrics, the clustering coefficient, turns out to be less relevant that the recent redundancy coefficient to analyse intricate overlapping properties of real networks.
Type de document :
Communication dans un congrès
ISCS 2014: Interdisciplinary Symposium on Complex Systems, 2014, Florence, Italy. Proceedings of ISCS 2014: Interdisciplinary Symposium on Complex Systems, 14, pp.309-318, 2015, Emergence, Complexity and Computation. 〈10.1007/978-3-319-10759-2_32〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01208320
Contributeur : Lionel Tabourier <>
Soumis le : mardi 6 octobre 2015 - 15:48:32
Dernière modification le : jeudi 22 novembre 2018 - 15:04:58
Document(s) archivé(s) le : jeudi 7 janvier 2016 - 10:13:47

Fichier

iscs14 (1).pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Fabien Tarissan. Comparing Overlapping Properties of Real Bipartite Networks. ISCS 2014: Interdisciplinary Symposium on Complex Systems, 2014, Florence, Italy. Proceedings of ISCS 2014: Interdisciplinary Symposium on Complex Systems, 14, pp.309-318, 2015, Emergence, Complexity and Computation. 〈10.1007/978-3-319-10759-2_32〉. 〈hal-01208320〉

Partager

Métriques

Consultations de la notice

191

Téléchargements de fichiers

139