Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 254

The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.

A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs

Open access
Sussman, Daniel L., Tang, Minh, Fishkind, Donniell E., Priebe, Carey E.·2012·Journal of the American Statistical Association

Abstract

We present a method to estimate block membership of nodes in a random graph generated by a stochastic blockmodel. We use an embedding procedure motivated by the random dot product graph model, a particular example of the latent position model. The embedding associates each node with a vector; these vectors are clustered via minimization of a square error criterion. We prove that this method is consistent for assigning nodes to blocks, as only a negligible number of nodes will be misassigned. We prove consistency of the method for directed and undirected graphs. The consistent block assignment makes possible consistent parameter estimation for a stochastic blockmodel. We extend the result in the setting where the number of blocks grows slowly with the number of nodes. Our method is also computationally feasible even for very large graphs. We compare our method with Laplacian spectral clustering through analysis of simulated data and a graph derived from Wikipedia documents.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/01621459.2012.699795

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 24 references

Research works printed but not linked: 6

  1. Airoldi E. M., 2008, The Journal of Machine Learning Research, 9, 1981
  2. Fjallstrom P., 1998, Computer and Information Science, 3
  3. Marchette D., 2011, Proceedings of the 57th ISI World Statistics Congress
  4. Newman M., 2004, Physical Review, 69, 1
  5. 10.1137/040607605 · doi:10.1137/040607605
  6. 10.1007/s00180-009-0158-8 · doi:10.1007/s00180-009-0158-8

Cited by

See all 254

Metadata

Authors
Sussman, D. L., Tang, M., Fishkind, D. E., & Priebe, C. E.
Venue
Journal of the American Statistical Association
Published
2012-09
Volume
107
Issue
499
Pages
1119-1128
ISSN
  • 0162-1459 (ISSN-L)
  • 1537-274X
OpenAlex
W1987349051
Cited by
254
References
24
FWCI
11.19
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs. https://app.cochat.ai/papers/10.1080/01621459.2012.699795
The paper
Sussman, D. L., Tang, M., Fishkind, D. E., & Priebe, C. E. (2012). A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.2012.699795

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.