OurBigBook
About
$
Donate
Sign in
Sign up
Wilson's algorithm
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Combinatorics
Tree (graph theory)
Spanning tree
Uniform spanning tree
Created
2026-09-24
Updated
2026-10-03
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Wilson's algorithm
samples
a
uniform spanning tree
by starting from
a
root
and successively attaching loop-erased
random walks
from
vertices
not yet in the
tree
.
Ancestors
(7)
Uniform spanning tree
Spanning tree
Tree (graph theory)
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(5)
Past exam of the mathematics course of the University of Cambridge
/
2017
/
iii
/
Paper 214
/
4
/
c
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2018
/
iii
/
Paper 214
/
4
/
b
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2019
/
iii
/
Paper 214
/
4
/
b
/
Solution
Uniform spanning tree of a recurrent infinite graph
Uniform-spanning-tree path representation of loop-erased random walk
Synonyms
(1)
codex/wilson-algorithm
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version