✦ LIBER ✦

Random-cluster measures and uniform spanning trees

✍ Scribed by Olle Häggström

Book ID: 107950485
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 433 KB
Volume: 59
Category: Article
ISSN: 0304-4149
DOI: 10.1016/0304-4149(95)00042-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-uniform random spanning trees on wei

Non-uniform random spanning trees on weighted graphs

✍ M. Mosbah; N. Saheb 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Most and least uniform spanning trees

✍ Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 708 KB

Minimal spanning tree analysis of regula

Minimal spanning tree analysis of regular, random and cluster structures

✍ C. Dussert; G. Rasigni; M. Rasigni; J. Palmari; A. Llebaria 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 377 KB

Uniform and minimal essential spanning f

Uniform and minimal essential spanning forests on trees

✍ Olle Häggström 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree ⌫,

Spectral Dimension and Random Walks on t

Spectral Dimension and Random Walks on the Two Dimensional Uniform Spanning Tree

✍ Martin T. Barlow; Robert Masson 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 397 KB

Optimal random matchings, tours, and spa

Optimal random matchings, tours, and spanning trees in hierarchically separated trees

✍ Csaba, Béla; Plick, Thomas A.; Shokoufandeh, Ali 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 989 KB