The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
Open accessAbstract
A random walk on a finite graph can be used to construct a uniform random spanning tree. It is shown how random walk techniques can be applied to the study of several properties of the uniform random spanning tree: the proportion of leaves, the distribution of degrees, and the diameter.
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.
Integrity signals
Registry
Cites
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.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Brouwer, A. E., & Haemers, W. H. (2011) · Universitext · doi:10.1007/978-1-4614-1939-6_12 · Cited by 1,987
cacute, C., Vs, M., Doob, M., & Sachs, H. (1980) · Cited by 1,478
Aldous, D. (1991) · The Annals of Probability · doi:10.1214/aop/1176990534 · Cited by 812
Self-citationApproximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Random walks, universal traversal sequences, and the complexity of maze problems
Aleliunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., & Rackoff, C. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.34 · Cited by 692
Generating random spanning trees
Broder, A. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63516 · Cited by 349
Some Inequalities for Reversible Markov Chains
Aldous, D. (1982) · Journal of the London Mathematical Society · doi:10.1112/jlms/s2-25.3.564 · Cited by 124
Self-citation
Cited by
Aldous, D. (1991) · The Annals of Probability · doi:10.1214/aop/1176990534 · Cited by 812
Self-citationLimiting the spread of misinformation in social networks
Budak, C., Agrawal, D., & El Abbadi, A. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963499 · Cited by 807
A survey of random processes with reinforcement
Pemantle, R. (2007) · Probability Surveys · doi:10.1214/07-ps094 · Cited by 578
Generating random spanning trees more quickly than the cover time
Wilson, D. B. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237880 · Cited by 487
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Aldous, D. J.
- Venue
- SIAM Journal on Discrete Mathematics
- Published
- 1990-11
- Volume
- 3
- Issue
- 4
- Pages
- 450-465
- ISSN
- 0895-4801 (ISSN-L)
- 1095-7146
- OpenAlex
- W1985234177
- Cited by
- 319
- References
- 14
- FWCI
- 4.72
- 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: The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. https://app.cochat.ai/papers/10.1137/0403039
- The paper
- Aldous, D. J. (1990). The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/0403039
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.