A mixture model for random graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

A mixture model for random graphs


{The Erdos-Rényi model of a network is simple and possesses many explicit expressions for average and asymptotic properties, but it does not fit well to real-word networks. The vertices of these networks are often structured in \textit{prior} unknown clusters (functionally related proteins or social communities) with different connectivity properties. We define a generalization of the Erdos-Rényi model called ERMG for Erdos-Rényi Mixtures for Graphs. This new model is based on mixture distributions. We give some of its properties, an algorithm to estimate its parameters and apply this method to uncover the modular structure of a network of enzymatic reactions.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5840.pdf (376.53 Ko) Télécharger le fichier

Dates and versions

inria-00070186 , version 1 (19-05-2006)


  • HAL Id : inria-00070186 , version 1


Jean-Jacques Daudin, Franck Picard, Stéphane Robin. A mixture model for random graphs. [Research Report] RR-5840, INRIA. 2006, pp.19. ⟨inria-00070186⟩
253 View
2246 Download


Gmail Facebook X LinkedIn More