The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Generating random spanning trees more quickly than the cover time
Open accessAbstract
This paper gives a new algorithm for generating random spanning trees. It too is simple, easy to code up, and has nice proofs. The new algorithm also has the following advantages:
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
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Exact sampling with coupled Markov chains and applications to statistical mechanics
Propp, J. G., & Wilson, D. B. (1996) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.0.co;2-o · Cited by 1,159
Self-citationGeometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Bollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sinclair, A. (1993) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0323-0 · Cited by 380
Generating random spanning trees
Broder, A. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63516 · Cited by 349
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
Aldous, D. J. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403039 · Cited by 319
Burton, R. M., & Pemantle, R. (1993) · The Annals of Probability · doi:10.1214/aop/1176989121 · Cited by 278
Cited by
Consensus-Based Decentralized Auctions for Robust Task Allocation
Choi, H.-L., Brunet, L., & How, J. P. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2022423 · Cited by 1,128
Limiting 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
Random Walk: A Modern Introduction
Lawler, G. F., & Limic, V. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511750854 · Cited by 796
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Neumann, F., & Witt, C. (2012) · Proceedings of the 14th annual conference companion on Genetic and evolutionary computation · doi:10.1145/2330784.2330928 · Cited by 319
Consistency and differences between centrality measures across distinct classes of networks
Oldham, S., Fulcher, B., Parkes, L., Arnatkevic̆iūtė, A., Suo, C., & Fornito, A. (2019) · PLOS ONE · doi:10.1371/journal.pone.0220061 · Cited by 296
Metadata
- Authors
- Wilson, D. B.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 296-303
- OpenAlex
- W2021272950
- Cited by
- 487
- References
- 15
- FWCI
- 19.75
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Generating random spanning trees more quickly than the cover time. https://app.cochat.ai/papers/10.1145/237814.237880
- The paper
- Wilson, D. B. (1996). Generating random spanning trees more quickly than the cover time. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. https://doi.org/10.1145/237814.237880
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.