The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Consistency of Single Linkage for High-Density Clusters
Abstract
High-density clusters are defined on a population with density f in r dimensions to be the maximal connected sets of form {x | f(x) ≥ c}. Single-linkage clustering is evaluated for consistency in detecting such high-density clusters—other standard hierarchical techniques, such as average and complete linkage, are hopelessly inconsistent for these clusters. The asymptotic consistency of single linkage closely depends on the percolation problem of Broadbent and Hammersley—if small spheres are removed at random from a solid, at which density of spheres will water begin to flow through the solid? If there is a single critical density such that no flow takes place below a certain density, and flow occurs through a single connected set above that density, then single linkage is consistent in separating high-density clusters (by disjoint single-linkage clusters that include a positive fraction of sample points in the respective clusters and pass arbitrarily close to all points in the respective clusters). The existence of a single critical point remains a conjecture. A weaker result is proved that shows that single-linkage clusters detect high-density clusters if there is a low enough valley separating them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Percolation and conductivity: A computer study. I
Pike, G. E., & Seager, C. H. (1974) · Physical Review B · doi:10.1103/physrevb.10.1421 · Cited by 1,031
Cited by
Hartigan, J. A., & Hartigan, P. M. (1985) · The Annals of Statistics · doi:10.1214/aos/1176346577 · Cited by 1,973
Self-citationLiu, R. Y., Parelius, J. M., & Singh, K. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031260 · Cited by 651
Consistency of spectral clustering
von Luxburg, U., Belkin, M., & Bousquet, O. (2008) · The Annals of Statistics · doi:10.1214/009053607000000640 · Cited by 540
Wasserman, L. (2018) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-031017-100045 · Cited by 514
Onk-connectivity for a geometric random graph
Penrose, M. D. (1999) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199909)15:2<145::aid-rsa2>3.0.co;2-g · Cited by 439
Metadata
- Authors
- Hartigan, J. A.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 1981-06
- Volume
- 76
- Issue
- 374
- Pages
- 388-394
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W2048675583
- Cited by
- 205
- References
- 1
- FWCI
- 3.47
- Type
- journal article
- Language
- en
- Open access
- closed
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: Consistency of Single Linkage for High-Density Clusters. https://app.cochat.ai/papers/10.1080/01621459.1981.10477658
- The paper
- Hartigan, J. A. (1981). Consistency of Single Linkage for High-Density Clusters. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.1981.10477658
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.