IDEAS home Printed from
   My bibliography  Save this paper

Optimal graphon estimation in cut distance


  • Olga Klopp

    (ESSEC Business School ; CREST)

  • Nicolas Verzelen



We consider the twin problems of estimating the connection probability matrix of an inhomogeneous random graph and the graphon function of graphon random graph. We establish the minimax estimation rates with respect to the cut metric for classes of block constant matrices and classes of step function graphons. Surprisingly, our results imply that, from the minimax point of view, the raw data, that is the adjacency matrix of the observed graph, is already optimal and more involved procedures cannot improve the convergence rates for this metric.

Suggested Citation

  • Olga Klopp & Nicolas Verzelen, 2017. "Optimal graphon estimation in cut distance," Working Papers 2017-42, Center for Research in Economics and Statistics.
  • Handle: RePEc:crs:wpaper:2017-42

    Download full text from publisher

    File URL:
    File Function: CREST working paper version
    Download Restriction: no

    References listed on IDEAS

    1. D. S. Choi & P. J. Wolfe & E. M. Airoldi, 2012. "Stochastic blockmodels with a growing number of classes," Biometrika, Biometrika Trust, vol. 99(2), pages 273-284.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yunpeng Zhao & Qing Pan & Chengan Du, 2019. "Logistic regression augmented community detection for network data with application in identifying autism‐related gene pathways," Biometrics, The International Biometric Society, vol. 75(1), pages 222-234, March.
    2. Hric, Darko & Kaski, Kimmo & Kivelä, Mikko, 2018. "Stochastic block model reveals maps of citation patterns and their evolution in time," Journal of Informetrics, Elsevier, vol. 12(3), pages 757-783.
    3. Lee, Kevin H. & Xue, Lingzhou & Hunter, David R., 2020. "Model-based clustering of time-evolving networks through temporal exponential-family random graph models," Journal of Multivariate Analysis, Elsevier, vol. 175(C).
    4. Tian, Yahui & Gel, Yulia R., 2019. "Fusing data depth with complex networks: Community detection with prior information," Computational Statistics & Data Analysis, Elsevier, vol. 139(C), pages 99-116.
    5. Zhang, Yue & Yuan, Mingao, 2020. "Nonreconstruction of high-dimensional stochastic block model with bounded degree," Statistics & Probability Letters, Elsevier, vol. 158(C).
    6. Dragana M. Pavlović & Bryan R.L. Guillaume & Soroosh Afyouni & Thomas E. Nichols, 2020. "Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 74(3), pages 363-396, August.
    7. Haiyan Liu & Ick Hoon Jin & Zhiyong Zhang & Ying Yuan, 2021. "Social Network Mediation Analysis: A Latent Space Approach," Psychometrika, Springer;The Psychometric Society, vol. 86(1), pages 272-298, March.
    8. Zhao, Yunpeng, 2020. "A note on new Bernstein-type inequalities for the log-likelihood function of Bernoulli variables," Statistics & Probability Letters, Elsevier, vol. 163(C).
    9. A. Athreya & C. E. Priebe & M. Tang & V. Lyzinski & D. J. Marchette & D. L. Sussman, 2016. "A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 78(1), pages 1-18, February.
    10. Babkin, Sergii & Stewart, Jonathan R. & Long, Xiaochen & Schweinberger, Michael, 2020. "Large-scale estimation of random graph models with local dependence," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).

    More about this item


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:crs:wpaper:2017-42. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: . General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Secretariat General (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.