Parameter identifiability in a class of random graph mixture models - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Statistical Planning and Inference Année : 2011

Parameter identifiability in a class of random graph mixture models

Résumé

We prove identifiability of parameters for a broad class of random graph mixture models. These models are characterized by a partition of the set of graph nodes into latent (unobservable) groups. The connectivities between nodes are independent random variables when conditioned on the groups of the nodes being connected. In the binary random graph case, in which edges are either present or absent, these models are known as stochastic blockmodels and have been widely used in the social sciences and, more recently, in biology. Their generalizations to weighted random graphs, either in parametric or non-parametric form, are also of interest. Despite these many applications, the parameter identifiability issue for such models has only been touched upon in the literature. We give here a thorough investigation of this problem. Our work also has consequences for parameter estimation. In particular, the estimation procedure proposed by Frank and Harary for binary affiliation models is revisited in this article.
Fichier principal
Vignette du fichier
mixnet_ident_rev.pdf (386 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00591197 , version 1 (07-05-2011)

Identifiants

Citer

Elizabeth Allman, Catherine Matias, John Rhodes. Parameter identifiability in a class of random graph mixture models. Journal of Statistical Planning and Inference, 2011, 141 (5), pp.1719-1736. ⟨10.1016/j.jspi.2010.11.022⟩. ⟨hal-00591197⟩
156 Consultations
199 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More