✦ LIBER ✦

Random spanning tree

✍ Scribed by A Guénoche

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 263 KB
Volume: 4
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(83)90022-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

Random minimal spanning tree and percola

Random minimal spanning tree and percolation on the N-cube

✍ Mathew D. Penrose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 1 views

The N-cube is a graph with 2 N vertices and N 2 Ny1 edges. Suppose indepen- dent uniform random edge weights are assigned and let T be the spanning tree of minimal Ž . y 1 N ϱ y3 total weight. Then the weight of T is asymptotic to N 2 Ý i as N ª ϱ. Asymp-is1 totics are also given for the local stru

On the value of a random minimum spannin

On the value of a random minimum spanning tree problem

✍ A.M. Frieze 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w

Asymptotics for Euclidean minimal spanni

Asymptotics for Euclidean minimal spanning trees on random points

✍ David Aldous; J. Michael Steele 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 612 KB

Stochastic spanning tree problem

✍ Hiroaki Ishii; Shōgo Shiode; Toshio Nishida; Yoshikazu Namasuya 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 485 KB