Journal article · 2023 · Open access

Matching recovery threshold for correlated random graphs

Jian Ding, Hang Du

The Annals of Statistics, 51(4), 1718–1743 · Published 1 August 2023 · DOI 10.1214/23-aos2305

Open PDFView at the publisherCite this paper

In brief

“Matching recovery threshold for correlated random graphs” is a 2023 journal article by Jian Ding and Hang Du, published in The Annals of Statistics. OpenAlex counts 56 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
56
Most cited in
2026 (21)
Field-weighted impact
4.00
References
49
Authors
2

Abstract

For two correlated graphs which are independently sub-sampled from a common Erdős–Rényi graph G(n,p), we wish to recover their latent vertex matching from the observation of these two graphs without labels. When p=n−α+o(1) for α∈(0,1], we establish a sharp information-theoretic threshold for whether it is possible to correctly match a positive fraction of vertices. Our result sharpens a constant factor in a recent work by Wu, Xu and Yu.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Ding, J., & Du, H. (2023). Matching recovery threshold for correlated random graphs. The Annals of Statistics, 51(4), 1718–1743. https://doi.org/10.1214/23-aos2305

MLA 9

Ding, Jian, and Hang Du. “Matching recovery threshold for correlated random graphs.” The Annals of Statistics, vol. 51, no. 4, 2023, pp. 1718–1743. https://doi.org/10.1214/23-aos2305.

Chicago

Ding, Jian and Hang Du. 2023. “Matching recovery threshold for correlated random graphs.” The Annals of Statistics 51 (4): 1718–1743. https://doi.org/10.1214/23-aos2305.

Harvard

Ding, J. and Du, H. (2023) ‘Matching recovery threshold for correlated random graphs’, The Annals of Statistics, 51(4), pp. 1718–1743. doi:10.1214/23-aos2305.

IEEE

J. Ding and H. Du, “Matching recovery threshold for correlated random graphs,” The Annals of Statistics, vol. 51, no. 4, pp. 1718–1743, 2023, doi: 10.1214/23-aos2305.

BibTeX

@article{ding2023matching,
  title     = {{Matching recovery threshold for correlated random graphs}},
  author    = {Ding, Jian and Du, Hang},
  journal   = {The Annals of Statistics},
  year      = {2023},
  volume    = {51},
  number    = {4},
  pages     = {1718--1743},
  doi       = {10.1214/23-aos2305},
  url       = {https://doi.org/10.1214/23-aos2305}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202211
202366
20241111
20251717
20262121

Its field-weighted citation impact is 4.00: it has been cited 4.00 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques

  • Erdős-Rényi random graphs
  • information-theoretic threshold
  • sharp threshold
  • sparse graphs

Work with this paper

Most-cited papers in Physics and Astronomy

All highly cited Physics and Astronomy papers

Questions about this paper

How do I cite this paper in APA style?

Ding, J., & Du, H. (2023). Matching recovery threshold for correlated random graphs. The Annals of Statistics, 51(4), 1718–1743. https://doi.org/10.1214/23-aos2305

How many times has this paper been cited?

56 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Jian Ding, Hang Du.

What is the DOI of this paper?

10.1214/23-aos2305, permanently at https://doi.org/10.1214/23-aos2305. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.