Nonparametric graphon estimation

[author] Rohe, K.K., Chatterjee, S.S. and Yu, B.B. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist. 39 1878–1915

1915

Earlier work this paper cites.

[author] Romanovsky, V.V. (1923). Note on the moments of a Binomial ( p + q ) n (p+q)^{n} about its mean. Biometrika 15 410–412

1923

Earlier work this paper cites.

[author] Diaconis, P.P. (1977). Finite forms of de Finetti’s theorem on exchangeability. Synthese 36 271–281

1977

Earlier work this paper cites.

[author] Hoover, D. N.D. N. (1979). Relations on probability spaces and arrays of random variables. Princeton, NJ

1979

Earlier work this paper cites.

[author] Aldous, D. J.D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581–598

1981

Earlier work this paper cites.

[author] Green, P. J.P. J. and Silverman, B. W.B. W. (1994). Nonparametric Regression and Generalized Linear Models: A Roughness Penalty Approach. Chapman & Hall, London

1994

Earlier work this paper cites.

[author] Shaked, M.M. and Shanthikumar, J. G.J. G. (1994). Stochastic Orders and Their Applications. Academic Press, Boston, MA

1994

Earlier work this paper cites.

[author] Alon, N.N. (1995). A note on network reliability. In Discrete Probability and Algorithms (D.D. Aldous, P.P. Diaconis, J.J. Spencer and J. M.J. M. Steele, eds.) 11–14. Springer-Verlag, New York

1995

Earlier work this paper cites.

[author] Birgé, L.L. and Massart, P.P. (1998). Minimum contrast estimators on sieves: Exponential bounds and rates of convergence. Bernoulli 4 329–375

1998

Earlier work this paper cites.

[author] DeVore, Ronald AR. A. (1998). Nonlinear approximation. Acta numerica 7 51–150

1998

Earlier work this paper cites.

[author] Bollobás, B.B., Janson, S.S. and Riordan, O.O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3–122

2007

Earlier work this paper cites.

[author] Durrett, R.R. (2007). Random Graph Dynamics. Cambridge University Press, Cambridge, UK

2007

Cited alongside, same era.

[author] Diaconis, P.P. and Janson, S.S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. 28 33–61

2008

Cited alongside, same era.

[author] Bickel, P. J.P. J. and Chen, A.A. (2009). A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Natl. Acad. Sci. USA 106 21068–21073

2009

Cited alongside, same era.

[author] Bollobás, B.B. and Riordan, O.O. (2009). Metrics for sparse graphs. In Surveys in Combinatorics 2009 (S.S. Huczynska, J. D.J. D. Mitchell and C. M.C. M. Roney-Dougal, eds.) 211–287. Cambridge University Press, Cambridge, UK

2009

Cited alongside, same era.

[author] Janson, S.S. (2010). Asymptotic equivalence and contiguity of some random graphs. Random Structures Algorithms 36 26–45

[author] Lovász, L.L. (2012). Large Networks and Graph Limits. American Mathematical Society, Providence, RI

2012

Later among the works it cites.

[author] Zhao, Y.Y., Levina, E.E. and Zhu, J.J. (2012). Consistency of community detection in networks under degree-corrected stochastic block models. Ann. Statist. 40 2266–2292

Original

2012

Later among the works it cites.

[author] Arias-Castro, E.E. and Grimmett, G. R.G. R. (2013). Cluster detection in networks using percolation. Bernoulli 19 676–719

2013

Closest in time.

[author] Ball, F.F., Britton, T.T. and Sirl, D.D. (2013). A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon. J. Math. Biol. 66 979–1019

2013

Closest in time.

[author] Choi, D. S.D. S. and Wolfe, P. J.P. J. (2013). Co-clustering separately exchangeable network data. Ann. Statist. To appear (arXiv:1212.4093)