Nonparametric estimation and testing of exchangeable graph models

Journal of Machine Learning Research

Volumn 33, Issue , 2014, Pages 1060-1067

  Yang, Justin J ^a   Han, Qiuyi ^a   Airoldi, Edoardo M ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPH THEORY; STATISTICAL TESTS;

ADJACENCY MATRICES; CANONICAL REPRESENTATIONS; HYPOTHESIS TESTING; NON-PARAMETRIC ESTIMATIONS; NONPARAMETRIC APPROACHES; PROBABILITY MATRIXES; SINGULAR VALUES; THEORY AND METHODS;

MATRIX ALGEBRA;

EID: 84922583027     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (32)

1. E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing. Mixed-membership stochastic blockmodels. Journal of Machine Learning Research, 9:1981-2014, 2008.
2. E. M. Airoldi, T. B. Costa, and S. H. Chan. Stochastic blockmodel approximation of a graphon: Theory and consistent estimation. In Advances in Neural Information Processing Systems (NIPS), vol. 26, 692-700, 2013.
3. D. J. Aldous. Representations for partially exchangeable arrays of random variables. Journal of Multivariate Analysis, 11:581-598, December 1981.
4. H. Azari and E. M. Airoldi. Graphlet decomposition of a weighted network. Journal of Machine Learning Research, W&CP, 22:54-63, 2012.
5. P. J. Bickel and A. Chen. A nonparametric view of network models and newman-girvan and other modularities. In Proceedings of the National Academy of Sciences of the United States of America, vol. 106, 21068-21073, 2009.
6. P. J. Bickel, A. Chen, and E. Levina. The method of moments and degree distributions for network models. Annals of Statistics, 39(5):2280-2301, 2011.
7. J. K. Blitzstein and P. Diaconis. A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Technical report, Stanford University, 2006.
8. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi. Convergent sequences of dense graph I: Subgraph frequencies, metric properties and testing. Advances in Mathematics, 219:1801-1851, 2008.
9. C. Borgs, J. T. Chayes, and L. Lovász. Moments of two-variable functions and the uniqueness of graph limits. Geometric and Functional Analysis, 19:1597-1619, 2010.
10. S. H. Chan and E. M. Airoldi. A consistent histogram estimator for exchangeable graph models. Journal of Machine Learning Research, W&CP, 32:208-216, 2014.
11. S. H. Chan, R. Khoshabeh, K. B. Gibson, P. E. Gill, and T. Q. Nguyen. An augmented lagrangian method for total variation video restoration. IEEE Transactions on Image Processing, 20(11):3097-3111, 2011.
12. S. H. Chan, T. B. Costa, and E. M. Airoldi. Estimation of exchangeable random graph models by stochastic blockmodel approximation. In Proc. IEEE Global Conference on Signal and Information Processing (GlobalSIP), 293-296, 2013.
13. S. Chatterjee. Matrix estimation by universal singular value thresholding. ArXiv:1212.1247, 2012. Unpublished manuscript.
14. D. S. Choi, P. J. Wolfe, and E. M. Airoldi. Stochastic blockmodels with a growing number of classes. Biometrika, 99:273-284, 2012.
15. P. Diaconis and S. Janson. Graph limits and exchangeable random graphs. Rendiconti di Matematica edelle sue Applicazioni, Series VII, 28:33-61, 2008.
16. P. Erdös and A. Renyi. On random graphs. Publicationes Mathematicae, 6:290-297, 1959.
17. E. N. Gilbert. Random graphs. Annals of Mathematical Statistics, 30(4):1141-1144, 1959.
18. A. Goldenberg, A. X. Zheng, S. E. Fienberg, and E. M. Airoldi. A survey of statistical network models. Foundations and Trends in Machine Learning, 2:129-233, 2009.
19. D. N. Hoover. Relations on probability spaces and arrays of random variables. Preprint, Institute for Advanced Study, Princeton, NJ, 1979.
20. O. Kallenberg. On the representation theorem for exchangeable arrays. Journal of Multivariate Analysis, 30(1):137-154, 1989.
21. O. Kallenberg. Probabilistic Symmetries and Invariance Principles. Springer, 2005.
22. E. Kolaczyk. Statistical Analysis of Network Data: Methods and Models. Springer, 2009.
23. P. Latouche and S. Robin. Bayesian model averaging of stochastic block models to estimate the graphon function and motif frequencies in a w-graph model. ArXiv:1310.6150, 2013. Unpublished manuscript.
24. J. R. Lloyd, P. Orbanz, Z. Ghahramani, and D. M. Roy. Random function priors for exchangeable arrays with applications to graphs and relational data. In Advances in Neural Information Processing Systems (NIPS), 2012.
25. K. T. Miller, T. S. Griffiths, and M. I. Jordan. Nonparametric latent fature models for link prediction. In Advances in Neural Information Processing Systems (NIPS), 2009.
26. K. Nowicki and T. Snijders. Estimation and prediction of stochastic block structures. Journal of American Statistical Association, 96:1077-1087, 2001.
27. B. P. Olding and P. J. Wolfe. Inference for graphs and networks: Extending classical tools to modern data. ArXiv:0906.4980, 2009. Unpulished manuscript.
28. P. Orbanz and D. M. Roy. Bayesian models of graphs, arrays and other exchangeable random structures, 2013. Unpublished manuscript.
29. K. Rohe, S. Chatterjee, and B. Yu. Spectral clustering and the high-dimensional stochastic blockmodel. The Annals of Statistics, 39(4):1878-1915, 2011.
30. M. Tang, D. L. Sussman, and C. E. Priebe. Universally consistent vertex classification for latent positions graphs. Annals of Statistics, 2013. In press.
31. P. J. Wolfe and S. C. Olhede. Nonparametric graphon estimation. ArXiv:1309.5936, 2013. Unpublished manuscript.
32. J. J. Yang, Q. Han, and E. M. Airoldi. Nonparametric estimation and testing of exchangeable graph models. Technical Report, 2014.