Fetching the paper…
Reading the bibliography…
Consider the problem of estimating the entries of a large matrix, when the observed entries are noisy versions of a small random fraction of the original entries.
Rohe, KarlK., Chatterjee, SouravS. andYu, BinB. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist. 39 1878–1915
1915
Earlier work this paper cites.
Bernstein, S.S. (1924). Sur une modification de l’inéqualité de Tchebichef. Annals Science Institute Sav. Ukraine, Sect. Math. I (Russian, French summary.) 38–49
1924
Earlier work this paper cites.
1929
Earlier work this paper cites.
Bradley, Ralph AllanR. A. andTerry, Milton E.M. E. (1952). Rank analysis of incomplete block designs. I. The method of paired comparisons. Biometrika 39 324–345
1952
Earlier work this paper cites.
Luce, R. DuncanR. D. (1959). Individual Choice Behavior: A Theoretical Analysis. Wiley, New York
1959
Earlier work this paper cites.
Bennett, G.G. (1962). Probability inequalities for sums of independent random variables. J. Amer. Statist. Assoc. 57 33–45
1962
Earlier work this paper cites.
Rao, P. V.P. V. andKupper, L. L.L. L. (1967). Ties in paired-comparison experiments: A generalization of the Bradley–Terry model. J. Amer. Statist. Assoc. 62 194–204
1967
Earlier work this paper cites.
Spence, I.I. andDomoney, D.D. (1974). Single subject incomplete designs for nonmetric multidimensional scaling. Psychometrika 39 469–490
1974
Earlier work this paper cites.
Plackett, R. L.R. L. (1975). The analysis of permutations. J. R. Stat. Soc. Ser. C. Appl. Stat. 24 193–202
1975
Earlier work this paper cites.
Davidson, Roger R.R. R. andFarquhar, Peter H.P. H. (1976). A bibliography on the method of paired comparisons. Biometrics 32 241–252
1976
Earlier work this paper cites.
Luce, R. DuncanR. D. (1977). The choice axiom after twenty years. J. Math. Psych. 15 215–233
1977
Earlier work this paper cites.
Aldous, David J.D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581–598
1981
Earlier work this paper cites.
Füredi, Z.Z. andKomlós, J.J. (1981). The eigenvalues of random symmetric matrices. Combinatorica 1 233–241
1981
Earlier work this paper cites.
Hoover, D. N.D. N. (1982). Row-column exchangeability and a generalized model for probability. In Exchangeability in Probability and Statistics (Rome, 1981) 281–291. North-Holland, Amsterdam
1981
Earlier work this paper cites.
Cai, Jian-FengJ.-F., Candès, Emmanuel J.E. J. andShen, ZuoweiZ. (2010). A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20 1956–1982
1982
Earlier work this paper cites.
Holland, Paul W.P. W., Laskey, Kathryn BlackmondK. B. andLeinhardt, SamuelS. (1983). Stochastic blockmodels: First steps. Social Networks 5 109–137
1983
Earlier work this paper cites.
Grone, RobertR., Johnson, Charles R.C. R., de Sá, Eduardo M.E. M. andWolkowicz, HenryH. (1984). Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58 109–124
1984
Earlier work this paper cites.
David, H. A.H. A. (1988). The Method of Paired Comparisons, 2nd ed. Griffin’s Statistical Monographs & Courses 41. Oxford Univ. Press, London
1988
Earlier work this paper cites.
Diaconis, PersiP. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics Lecture Notes—Monograph Series 11. IMS, Hayward, CA
1988
Earlier work this paper cites.
Johnson, Charles R.C. R. (1990). Matrix completion problems: A survey. In Matrix Theory and Applications (Phoenix, AZ, 1989). Proc. Sympos. Appl. Math. 40 171–198. Amer. Math. Soc., Providence, RI
1989
Earlier work this paper cites.
Agresti, AlanA. (1990). Categorical Data Analysis. Wiley, New York
1990
Earlier work this paper cites.
Bakonyi, MihályM. andJohnson, Charles R.C. R. (1995). The Euclidean distance matrix completion problem. SIAM J. Matrix Anal. Appl. 16 646–654
1995
Earlier work this paper cites.
Donoho, David L.D. L. andJohnstone, Iain M.I. M. (1995). Adapting to unknown smoothness via wavelet shrinkage. J. Amer. Statist. Assoc. 90 1200–1224
1995
Earlier work this paper cites.
Talagrand, MichelM. (1996). A new look at independence. Ann. Probab. 24 1–34
1996
Earlier work this paper cites.
Bhatia, RajendraR. (1997). Matrix Analysis. Graduate Texts in Mathematics 169. Springer, New York
1997
Earlier work this paper cites.
Snijders, Tom A. B.T. A. B. andNowicki, KrzysztofK. (1997). Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classification 14 75–100
1997
Earlier work this paper cites.
Hastie, TrevorT. andTibshirani, RobertR. (1998). Classification by pairwise coupling. Ann. Statist. 26 451–471
1998
Earlier work this paper cites.
Alfakih, Abdo Y.A. Y., Khandani, AmirA. andWolkowicz, HenryH. (1999). Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12 13–30
1999
Earlier work this paper cites.
Simons, GordonG. andYao, Yi-ChingY.-C. (1999). Asymptotics when the number of parameters tends to infinity in the Bradley–Terry model for paired comparisons. Ann. Statist. 27 1041–1060
1999
Earlier work this paper cites.
Lange, KennethK., Hunter, David R.D. R. andYang, IlsoonI. (2000). Optimization transfer using surrogate objective functions. J. Comput. Graph. Statist. 9 1–59
2000
Earlier work this paper cites.
Achlioptas, DimitrisD. andMcSherry, FrankF. (2001). Fast computation of low rank matrix approximations. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing 611–618 (electronic). ACM, New York
2001
Earlier work this paper cites.
Azar, Y.Y., Flat, A.A., Karlin, A.A., McSherry, F.F. andSala, J.J. (2001). Spectral analysis of data. In Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing
2001
Earlier work this paper cites.
Condon, AnneA. andKarp, Richard M.R. M. (2001). Algorithms for graph partitioning on the planted partition model. Random Structures Algorithms 18 116–140
2001
Earlier work this paper cites.
Nowicki, KrzysztofK. andSnijders, Tom A. B.T. A. B. (2001). Estimation and prediction for stochastic blockstructures. J. Amer. Statist. Assoc. 96 1077–1087
2001
Cited alongside, same era.
Fazel, M.M. (2002). Matrix rank minimization with applications. Ph.D. thesis, Stanford Univ., Stanford, CA
2002
Cited alongside, same era.
Hoff, Peter D.P. D., Raftery, Adrian E.A. E. andHandcock, Mark S.M. S. (2002). Latent space approaches to social network analysis. J. Amer. Statist. Assoc. 97 1090–1098
2002
Cited alongside, same era.
Hunter, David R.D. R. (2004). MM algorithms for generalized Bradley–Terry models. Ann. Statist. 32 384–406
2004
Cited alongside, same era.
Adams, E.E. (2005). Bayesian analysis of linear dominance hierarchies. Animal Behaviour 69 1191–1201
2005
Cited alongside, same era.
Keshavan, Raghunandan H.R. H., Montanari, AndreaA. andOh, SewoongS. (2010). Matrix completion from a few entries. IEEE Trans. Inform. Theory 56 2980–2998
2010
Later among the works it cites.
Mazumder, RahulR., Hastie, TrevorT. andTibshirani, RobertR. (2010). Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11 2287–2322
2010
Later among the works it cites.
Oh, S.S., Montanari, A.A. andKarbasi, A.A. (2010). Sensor network localization from local connectivity: Performance analysis for the MDS-MAP algorithm. In Information Theory Workshop (ITW) 1–5. IEEE, New York
2010
Later among the works it cites.
Bickel, Peter J.P. J., Chen, AiyouA. andLevina, ElizavetaE. (2011). The method of moments and degree distributions for network models. Ann. Statist. 39 2280–2301
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Borg, IngwerI. andGroenen, Patrick J. F.P. J. F. (2005). Modern Multidimensional Scaling: Theory and Applications, 2nd ed. Springer, New York
2005
Cited alongside, same era.
Rennie, J. D.J. D. andSrebro, N.N. (2005). Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd International Conference on Machine Learning 713–719. ACM, New York
2005
Cited alongside, same era.
Biswas, P.P., Lian, T.-C.T.-C., Wang, T.-C.T.-C. andYe, Y.Y. (2006). Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sen. Netw. 2 188–220
2006
Cited alongside, same era.
Borgs, ChristianC., Chayes, JenniferJ., Lovász, LászlóL., Sós, Vera T.V. T. andVesztergombi, KatalinK. (2006). Counting graph homomorphisms. In Topics in Discrete Mathematics. Algorithms Combin. 26 315–371. Springer, Berlin
2006
Cited alongside, same era.
Candès, Emmanuel J.E. J., Romberg, JustinJ. andTao, TerenceT. (2006). Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52 489–509
2006
Cited alongside, same era.
Donoho, David L.D. L. (2006). Compressed sensing. IEEE Trans. Inform. Theory 52 1289–1306
2006
Cited alongside, same era.
Görür, D.D., Jäkel, F.F. andRasmussen, C. E.C. E. (2006). A choice model with infinitely many latent features. In Proceedings of the 23rd Annual International Conference on Machine Learning 361–368. ACM, New York
2006
Cited alongside, same era.
2011
Later among the works it cites.
Chatterjee, SouravS. andVaradhan, S. R. S.S. R. S. (2011). The large deviation principle for the Erdős–Rényi random graph. European J. Combin. 32 1000–1017
2011
Later among the works it cites.
Javanmard, A.A. andMontanari, A.A. (2011). Localization from incomplete noisy distance measurements. In 2011 IEEE International Symposium on Information Theory Proceedings (ISIT) 1584–1588. IEEE, New York
2011
Later among the works it cites.
Koltchinskii, VladimirV. (2011). Von Neumann entropy penalization and low-rank matrix estimation. Ann. Statist. 39 2936–2973
2011
Later among the works it cites.
Koltchinskii, VladimirV., Lounici, KarimK. andTsybakov, Alexandre B.A. B. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Statist. 39 2302–2329
2011
Later among the works it cites.
Negahban, SahandS. andWainwright, Martin J.M. J. (2011). Estimation of (near) low-rank matrices with noise and high-dimensional scaling. Ann. Statist. 39 1069–1097
2011
Later among the works it cites.
Rohde, AngelikaA. andTsybakov, Alexandre B.A. B. (2011). Estimation of high-dimensional low-rank matrices. Ann. Statist. 39 887–930
2011
Later among the works it cites.
Borgs, C.C., Chayes, J. T.J. T., Lovász, L.L., Sós, V. T.V. T. andVesztergombi, K.K. (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 151–219
2012
Closest in time.
Caron, FrançoisF. andDoucet, ArnaudA. (2012). Efficient Bayesian inference for generalized Bradley–Terry models. J. Comput. Graph. Statist. 21 174–196
2012
Closest in time.
Chatterjee, SouravS. andVaradhan, S. R. S.S. R. S. (2012). Large deviations for random matrices. Commun. Stoch. Anal. 6 1–13
2012
Closest in time.
Chaudhuri, K.K., Chung, F.F. andTsiatas, A.A. (2012). Spectral clustering of graphs with general degrees in the extended planted partition model. J. Mach. Learn. Res. 35 1–23
2012
Closest in time.
Choi, D. S.D. S., Wolfe, P. J.P. J. andAiroldi, E. M.E. M. (2012). Stochastic blockmodels with a growing number of classes. Biometrika 99 273–284
2012
Closest in time.
2012
Closest in time.
Lovász, LászlóL. (2012). Large Networks and Graph Limits. American Mathematical Society Colloquium Publications 60. Amer. Math. Soc., Providence, RI
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
Chatterjee, SouravS. andDiaconis, PersiP. (2013). Estimating and understanding exponential random graph models. Ann. Statist. 41 2428–2461
2013
Closest in time.
2013
Closest in time.
Radin, CharlesC. andYin, MeiM. (2013). Phase transitions in exponential random graphs. Ann. Appl. Probab. 23 2458–2471
2013
Closest in time.
2013
Closest in time.
Airoldi, E. M.E. M., Blei, D. M.D. M., Fienberg, S. E.S. E. andXing, E. P.E. P. (2008). Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9 1981–2014
2014
Closest in time.
Choi, DavidD. andWolfe, Patrick J.P. J. (2014). Co-clustering separately exchangeable network data. Ann. Statist. 42 29–63
2014
Closest in time.
Gavish, MatanM. andDonoho, David L.D. L. (2014). The optimal hard threshold for singular values is 4 / 3 4/\sqrt{3} . IEEE Trans. Inform. Theory 60 5040–5053
2014
Closest in time.
Yang, J. J.J. J., Han, Q.Q. andAiroldi, E. M.E. M. (2014). Nonparametric estimation and testing of exchangeable graph models. In Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics. Journal of Machine Learning Research, Conference and Workshop Proceedings, Vol. 33 1060–1067
2014
Closest in time.
Keshavan, Raghunandan H.R. H., Montanari, AndreaA. andOh, SewoongS. (2010). Matrix completion from noisy entries. J. Mach. Learn. Res. 11 2057–2078
2078
Closest in time.
Candès, Emmanuel J.E. J. andTao, TerenceT. (2010). The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory 56 2053–2080
2080
Closest in time.
Amini, Arash A.A. A., Chen, AiyouA., Bickel, Peter J.P. J. andLevina, ElizavetaE. (2013). Pseudo-likelihood methods for community detection in large sparse networks. Ann. Statist. 41 2097–2122
2097
Closest in time.