Uniform random spanning trees
| dc.creator | Pemantle, Robin | |
| dc.date | 2004-04-05 | |
| dc.date.accessioned | 2026-07-07T05:07:09Z | |
| dc.date.available | 2026-07-07T05:07:09Z | |
| dc.description | There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they predate both of these subjects, having been used by Kirchoff in the study of resistor networks. This article addresses the question about spanning trees most natural to anyone in probability theory, namely what does a typical spanning tree look like? | |
| dc.description | 75 pages | |
| dc.identifier | https://arxiv.org/abs/math/0404099 | |
| dc.identifier | http://arxiv.org/abs/math/0404099 | |
| dc.identifier | Topics in contemporary probability and its applications, J. L. Snell, editor, 1 - 54. CRC Press: Boca Raton (1994) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70746 | |
| dc.subject | Probability | |
| dc.title | Uniform random spanning trees | |
| dc.type | text |