Émilie Coupechoux and Fabien Tarissan
4ème Journées Modèles et l’Analyse des Réseaux : Approches Mathématiques et Informatique (MARAMI’13), 2013
Current models of random graphs do not capture all the properties observed in realworld networks. In particular, two cliques in such models generally do not have more than one node in common, while it is intuitive that, in social networks for instance, two friends have more than one interest in common. The model presented here aims at capturing this kind of property. More precisely, we present a model for random tripartite graphs such that the bipartite projection has degree and redundancy distributions close to those of a given bipartite graph.