Loop-erased partitioning of a graph: mean-field analysis (Q2144347)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Loop-erased partitioning of a graph: mean-field analysis |
scientific article |
Statements
Loop-erased partitioning of a graph: mean-field analysis (English)
0 references
13 June 2022
0 references
discrete Laplacian
0 references
loop-erased random walk
0 references
random partitions
0 references
spanning rooted forests
0 references
Wilson's algorithm
0 references
0 references
0 references
0 references
0 references
0 references