IDEAS home Printed from
   My bibliography  Save this article

A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs


  • A. Athreya

    () (Johns Hopkins University)

  • C. E. Priebe

    () (Johns Hopkins University)

  • M. Tang

    () (Johns Hopkins University)

  • V. Lyzinski

    () (Johns Hopkins University)

  • D. J. Marchette

    () (Naval Surface Warfare Center)

  • D. L. Sussman

    () (Harvard University)


Abstract We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. We use the spectral embedding of the adjacency matrix to construct consistent estimates for the latent positions, and we show that the appropriately scaled differences between the estimated and true latent positions converge to a mixture of Gaussian random variables. We state several corollaries, including an alternate proof of a central limit theorem for the first eigenvector of the adjacency matrix of an Erdos-Rényi random graph.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:sankha:v:78:y:2016:i:1:d:10.1007_s13171-015-0071-x
    DOI: 10.1007/s13171-015-0071-x

    Download full text from publisher

    File URL:
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    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.
    2. Aldous, David J., 1981. "Representations for partially exchangeable arrays of random variables," Journal of Multivariate Analysis, Elsevier, vol. 11(4), pages 581-598, December.
    3. Ting Yan & Jinfeng Xu, 2013. "A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices," Biometrika, Biometrika Trust, vol. 100(2), pages 519-524.
    4. Chris Fraley & Adrian E. Raftery, 1999. "MCLUST: Software for Model-Based Cluster Analysis," Journal of Classification, Springer;The Classification Society, vol. 16(2), pages 297-306, July.
    5. Daniel L. Sussman & Minh Tang & Donniell E. Fishkind & Carey E. Priebe, 2012. "A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 107(499), pages 1119-1128, September.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:bla:jorssb:v:79:y:2017:i:5:p:1295-1366 is not listed on IDEAS


    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:spr:sankha:v:78:y:2016:i:1:d:10.1007_s13171-015-0071-x. 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: (Sonal Shukla) or (Rebekah McClure). 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 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.

    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.