Parameter identifiability in a class of random graph mixture models

Journal of Statistical Planning and Inference

Volumn 141, Issue 5, 2011, Pages 1719-1736

  Allman, Elizabeth S ^a   Matias, Catherine ^b   Rhodes, John A ^a  

^a UNIVERSITY OF ALASKA FAIRBANKS   (United States)

^b University of Paris 5   (France)

Author keywords

Identifiability; Mixture model; Random graph; Stochastic blockmodel

Indexed keywords

EID: 78751706584     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jspi.2010.11.022     Document Type: Article

References (36)

1. Airoldi E., Blei D., Fienberg S., Xing E. Mixed-membership stochastic blockmodels. J. Mach. Learning Research 2008, 9:1981-2014.
2. Allman E., Matias C., Rhodes J. Identifiability of parameters in latent structure models with many observed variables. Ann. Statist. 2009, 37(6A):3099-3132.
3. Ambroise, C., Matias, C., 2010. New consistent and asymptotically normal estimators for random graph mixture models. Technical Report. http://arXiv:1003.5165.
4. Barrat A., Barthélemy M., Pastor-Satorras R., Vespignani A. The architecture of complex weighted networks. Proc. Nat. Acad. Sci. 2004, 101(11):3747-3752.
5. Berge, C., 1976. Graphs and Hypergraphs (E. Minieka, Trans.), second rev. ed. North-Holland Mathematical Library, vol. 6. North-Holland Publishing Company, Amsterdam, Oxford; American Elsevier Publishing, New York.
6. Carreira-Perpiñán M., Renals S. Practical identifiability of finite mixtures of multivariate Bernoulli distributions. Neural Comput. 2000, 12(1):141-152.
7. Cox D., Little J., O'Shea D. Ideals Varieties and Algorithms 1997, Springer-Verlag, New York. second ed.
8. Daudin J.-J., Picard F., Robin S. A mixture model for random graphs. Statist. Comput. 2008, 18(2):173-183.
9. Daudin, J.-J., Pierre, L., Vacher, C. Model for heterogeneous random networks using continuous latent variables and an application to a tree-fungus network. Biometrics 66 (4), in press, doi:. http://10.1111/j.1541-0420.2009.01378.x.
10. Erddouble acutes P., Gallai T. Graphs with points of prescribed degree. Graphen mit Punkten vorgeschriebenen Grades. Mat. Lapok 1961, 11:264-274.
11. Erddouble acutes P., Rényi A. On random graphs I. Publ. Math. Debrecen 1959, 6:290-297.
12. Frank O., Harary F. Cluster inference by using transitivity indices in empirical graphs. J. Amer. Statist. Assoc. 1982, 77(380):835-840.
13. Gyllenberg M., Koski T., Reilink E., Verlaan M. Nonuniqueness in probabilistic numerical identification of bacteria. J. Appl. Probab. 1994, 31(2):542-548.
14. Handcock M., Raftery A., Tantrum J. Model-based clustering for social networks. J. Roy. Statist. Soc. Ser. A 2007, 170(2):301-354.
15. Holland P., Laskey K., Leinhardt S. Stochastic blockmodels: some first steps. Soc. Networks 1983, 5:109-137.
16. Kruskal J. More factors than subjects, tests and treatments: an indeterminacy theorem for canonical decomposition and individual differences scaling. Psychometrika 1976, 41(3):281-293.
17. Kruskal J. Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebra Appl. 1977, 18(2):95-138.
18. Latouche, P., Birmelé, E., Ambroise, C. Overlapping stochastic block models with application to the French political blogosphere. Ann. Appl. Statist., to appear. http://www.imstat.org/aoas/supplements/future_issues.html.
19. Mariadassou M., Robin S., Vacher C. Uncovering latent structure in valued graphs: a variational approach. Ann. Appl. Statist. 2010, 4(2):715-742.
20. Newman M.E.J. The structure and function of complex networks. SIAM Rev. 2003, 45(2):167-256. (electronic).
21. Newman M.E.J. Analysis of weighted networks. Phys. Rev. E 2004, 70:056131.
22. Newman M.E.J., Leicht E.A. Mixture models and exploratory analysis in networks. Proc. Nat. Acad. Sci. 2007, 104(23):9564-9569.
23. Nowicki K., Snijders T. Estimation and prediction for stochastic blockstructures. J. Amer. Statist. Assoc. 2001, 96(455):1077-1087.
24. Petrie T. Probabilistic functions of finite state Markov chains. Ann. Math. Statist. 1969, 40:97-115.
25. Picard F., Miele V., Daudin J.-J., Cottret L., Robin S. Deciphering the connectivity structure of biological networks using MixNet. BMC Bioinformatics 2009, 10:1-11.
26. Rhodes J. A concise proof of Kruskal's theorem on tensor decomposition. Linear Algebra Appl. 2010, 432(7):1818-1824.
27. Snijders T., Nowicki K. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classification 1997, 14(1):75-100.
28. Tallberg C. A Bayesian approach to modeling stochastic blockstructures with covariates. J. Math. Sociology 2005, 29(1):1-23.
29. Teicher H. Identifiability of mixtures. Ann. Math. Statist. 1961, 32:244-248.
30. Teicher H. Identifiability of finite mixtures. Ann. Math. Statist. 1963, 34:1265-1269.
31. Teicher H. Identifiability of mixtures of product measures. Ann. Math. Statist. 1967, 38:1300-1302.
32. Titterington, D., Smith, A., Makov, U., 1985. Statistical Analysis of Finite Mixture Distributions. In: Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics.
33. Tomasi G., Bro R. A comparison of algorithms for fitting the PARAFAC model. Comput. Statist. Data Anal. 2006, 50(7):1700-1734.
34. White H., Boorman S., Breiger R. Social structure from multiple networks I: blockmodels of roles and positions. Amer. J. Sociology 1976, 81:730-779.
35. Zanghi H., Ambroise C., Miele V. Fast online graph clustering via Erddouble acutes Rényi mixture. Pattern Recogn. 2008, 41(12):3592-3599.
36. Zanghi H., Picard F., Miele V., Ambroise C. Strategies for online inference of model-based clustering in large and growing networks. Ann. Appl. Statist. 2010, 4(2):687-714.