𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Localization on Quantum Graphs with Random Edge Lengths

✍ Scribed by Frédéric Klopp; Konstantin Pankrashkin

Publisher
Springer
Year
2009
Tongue
English
Weight
214 KB
Volume
87
Category
Article
ISSN
0377-9017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A family of random trees with random edg
A family of random trees with random edge lengths
✍ David Aldous; Jim Pitman 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB 👁 3 views

We introduce a family of probability distributions on the space of trees with I labeled vertices and possibly extra unlabeled vertices of degree 3, whose edges have positive real lengths. Formulas for distributions of quantities such as degree sequence, shape, and total length are derived. An interp

Random walks on edge transitive graphs
Random walks on edge transitive graphs
✍ JoséLuis Palacios; JoséMiguel Renom 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 337 KB

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.

Random walks on edge-transitive graphs (
Random walks on edge-transitive graphs (II)
✍ José Luis Palacios; José Miguel Renom; Pedro Berrizbeitia 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We give formulas, in terms of the number of pure k-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs, extending our prior results for neighboring vertices and also extending results of Devroye-Sbihi and Biggs concerning dis