Table of Contents Author Guidelines Submit a Manuscript
Journal of Probability and Statistics
Volume 2015 (2015), Article ID 657965, 14 pages
http://dx.doi.org/10.1155/2015/657965
Research Article

Estimating Parameters of a Probabilistic Heterogeneous Block Model via the EM Algorithm

Institute of Mathematics, Budapest University of Technology and Economics, Műegyetem Rakpart 3, Budapest 1111, Hungary

Received 16 June 2015; Revised 6 November 2015; Accepted 10 November 2015

Academic Editor: Hyungjun Cho

Copyright © 2015 Marianna Bolla and Ahmed Elbanna. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Clauset, M. E. J. Newman, and C. Moore, “Finding community structure in very large networks,” Physical Review E, vol. 70, no. 6, Article ID 066111, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. M. E. J. Newman, Networks, An Introduction, Oxford University Press, Oxford, UK, 2010. View at MathSciNet
  3. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3–5, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. Bolla, “Penalized versions of the Newman-Girvan modularity and their relation to normalized cuts and k-means clustering,” Physical Review E, vol. 84, no. 1, Article ID 016108, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Bolla, Spectral Clustering and Biclustering. Learning Large Graphs and Contingency Tables, Wiley, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  6. C. R. Rao, Linear Statistical Inference and Its Applications, Wiley, 1973. View at MathSciNet
  7. G. J. McLachlan, The EM Algorithm and Extensions, John Wiley & Sons, New York, NY, USA, 1997.
  8. S. Chatterjee, P. Diaconis, and A. Sly, “Random graphs with a given degree sequence,” Annals of Applied Probability, vol. 21, no. 4, pp. 1400–1435, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. V. Csiszár, P. Hussami, J. Komlós, T. F. Móri, L. Rejtő, and G. Tusnády, “When the degree sequence is a sufficient statistic,” Acta Mathematica Hungarica, vol. 134, no. 1-2, pp. 45–53, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  10. A. Rinaldo, S. Petrović, and S. E. Fienberg, “Maximum lilkelihood estimation in the β-model,” Annals of Statistics, vol. 41, no. 3, pp. 1085–1110, 2013. View at Publisher · View at Google Scholar
  11. P. W. Holland and S. Leinhardt, “An exponential family of probability distributions for directed graphs,” Journal of the American Statistical Association, vol. 76, no. 373, pp. 33–50, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  12. P. J. Bickel and A. Chen, “A nonparametric view of network models and Newman-Girvan and other modularities,” Proceedings of the National Academy of Sciences of the United States of America, vol. 106, no. 50, pp. 21068–21073, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. K. Rohe, S. Chatterjee, and B. Yu, “Spectral clustering and the high-dimensional stochastic blockmodel,” The Annals of Statistics, vol. 39, no. 4, pp. 1878–1915, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. P. W. Holland, K. B. Laskey, and S. Leinhardt, “Stochastic blockmodels: first steps,” Social Networks, vol. 5, no. 2, pp. 109–137, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. B. Karrer and M. E. Newman, “Stochastic blockmodels and community structure in networks,” Physical Review E, vol. 83, no. 1, Article ID 016107, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. D. S. Choi, P. J. Wolfe, and E. M. Airoldi, “Stochastic blockmodels with a growing number of classes,” Biometrika, vol. 99, no. 2, pp. 273–284, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. D. E. Fishkind, D. L. Sussman, M. Tang, J. T. Vogelstein, and C. E. Priebe, “Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown,” SIAM Journal on Matrix Analysis and Applications, vol. 34, no. 1, pp. 23–39, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. B. Bollobás, S. Janson, and O. Riordan, “The phase transition in inhomogeneous random graphs,” Random Structures & Algorithms, vol. 31, no. 1, pp. 3–122, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. P. Erdős and A. Renyi, “On the evolution of random graphs,” Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61, 1960. View at Google Scholar
  20. E. Szemeredi, “Regular partitions of graphs,” in Colloque Inter, J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, and D. Sotteau, Eds., CNRS. No. 260, Problémes Combinatoires et Théorie Graphes, pp. 399–401, 1976. View at Google Scholar
  21. M. Bolla, “Relating multiway discrepancy and singular values of nonnegative rectangular matrices,” Discrete Applied Mathematics, 2015. View at Publisher · View at Google Scholar
  22. G. Rasch, Studies in Mathematical Psychology: I. Probabilistic Models for Some Intelligence and Attainment Tests, Nielsen and Lydiche, Oxford, UK, 1960.
  23. G. Rasch, “On general laws and the meaning of measurement in psychology,” in Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, pp. 321–333, University of California Press, July 1961.
  24. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society Series B: Methodological, vol. 39, no. 1, pp. 1–38, 1977. View at Google Scholar · View at MathSciNet
  25. L. H. Ungar and D. P. Foster, “A formal statistical approach to collaborativefiltering,” in Proceedings of the Conference on Automatical Learning and Discovery (CONALD '98), 1998.
  26. T. Hofmann and J. Puzicha, “Latent class models for collaborative filtering,” in Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI '99), T. Dean, Ed., vol. 2, pp. 688–693, Morgan Kaufmann Publications, Stockholm, Sweden, July-August 1999.
  27. G. Casella and E. I. George, “Explaining the Gibbs sampler,” The American Statistician, vol. 46, no. 3, pp. 167–174, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  28. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Publisher · View at Google Scholar · View at Scopus
  29. S. L. Lauritzen, Extremal Families and Systems of Sufficient Statistics, vol. 49 of Lecture Notes in Statistics, Springer, Berlin, Germany, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  30. P. Erdős and T. Gallai, “Graphs with given degree of vertices,” Matematikai Lapok, vol. 11, pp. 264–274, 1960 (Hungarian). View at Google Scholar
  31. N. V. R. Mahadev and U. N. Peled, Threshold Graphs and Related Topics, vol. 56 of Annals of Discrete Mathematics, North-Holland, Amsterdam, The Netherlands, 1995. View at MathSciNet
  32. L. P. Stanley, “A zonotope associated with graphical degree sequences,” in Applied Geometry and Discrete Mathematics, vol. 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 555–570, American Mathematical Society, Providence, RI, USA, 1991. View at Google Scholar · View at MathSciNet
  33. P. L. Hammer, U. N. Peled, and X. Sun, “Difference graphs,” Discrete Applied Mathematics, vol. 28, no. 1, pp. 35–44, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. S. J. Haberman, “Log-linear models and frequency tables with small expected cell counts,” The Annals of Statistics, vol. 5, no. 6, pp. 1148–1169, 1977. View at Publisher · View at Google Scholar · View at MathSciNet
  35. A. Barvinok, “What does a random contingency table look like?” Combinatorics, Probability and Computing, vol. 19, no. 4, pp. 517–539, 2010. View at Publisher · View at Google Scholar
  36. A. Barvinok, “Matrices with prescribed row and column sums,” Linear Algebra and its Applications, vol. 436, no. 4, pp. 820–844, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  37. D. Gale, “A theorem on flows in networks,” Pacific Journal of Mathematics, vol. 7, pp. 1073–1082, 1957. View at Publisher · View at Google Scholar · View at MathSciNet
  38. H. J. Ryser, “Combinatorial properties of matrices of zeros and ones,” Canadian Journal of Mathematics, vol. 9, pp. 371–377, 1957. View at Google Scholar · View at MathSciNet
  39. J. Ford and D. R. Fulkerson, “Maximal flow through a network,” Canadian Journal of Mathematics, vol. 8, pp. 399–404, 1956. View at Google Scholar · View at MathSciNet
  40. A. Barvinok and J. A. Hartigan, “An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums,” Transactions of the American Mathematical Society, vol. 364, pp. 4323–4368, 2012. View at Publisher · View at Google Scholar
  41. A. Barvinok, “On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries,” Advances in Mathematics, vol. 224, no. 1, pp. 316–339, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning. Data Mining, Inference, and Prediction, Springer Series in Statistics, Springer, New York, NY, USA, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  43. V. Csiszar, P. Hussami, J. Komlos, T. F. Mori, L. Rejtő, and G. Tusnady, “Testing goodness of fit of random graph models,” Algorithms, vol. 5, no. 4, pp. 629–635, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  44. L. Négyessy, T. Nepusz, L. Zalányi, and F. Bazsó, “Convergence and divergence are mostly reciprocated properties of the connections in the network of cortical areas,” Proceedings of the Royal Society B: Biological Sciences, vol. 275, no. 1649, pp. 2403–2410, 2008. View at Publisher · View at Google Scholar · View at Scopus
  45. D. Yan, A. Chen, and M. I. Jordan, “Cluster forests,” Computational Statistics & Data Analysis, vol. 66, pp. 178–192, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. H. R. Bernard, P. D. Killworth, and L. Sailer, “Informant accuracy in social-network data V. An experimental attempt to predict actual communication from recall data,” Social Science Research, vol. 11, no. 1, pp. 30–66, 1982. View at Publisher · View at Google Scholar · View at Scopus
  47. R. Pálovics, A. Benczúr, L. Kocsis, T. Kiss, and E. Frigó, “Exploiting temporal influence in online recommendation,” in Proceedings of the 8th ACM Conference on Recommender Systems (RecSys '14), pp. 273–280, ACM, Foster City, Calif, USA, October 2014. View at Publisher · View at Google Scholar
  48. W. M. Rand, “Objective criteria for the evaluation of clustering methods,” Journal of the American Statistical Association, vol. 66, no. 336, pp. 846–850, 1971. View at Publisher · View at Google Scholar
  49. Y.-Y. Liu, J.-J. Slotine, and A.-L. Barabási, “Controllability of complex networks,” Nature, vol. 473, no. 7346, pp. 167–173, 2011. View at Publisher · View at Google Scholar · View at Scopus