Loop-erased partitioning of a graph: mean-field analysis (Q2144347)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Loop-erased partitioning of a graph: mean-field analysis |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7459620237350464
0 references
0.68287593126297
0 references
0.6801056861877441
0 references
0.6759175062179565
0 references
