✦ LIBER ✦

Bounds for mixing time of quantum walks on finite graphs

✍ Scribed by Kargin, Vladislav

Book ID: 121865293
Publisher: IOP Publishing
Year: 2010
Tongue: English
Weight: 164 KB
Volume: 43
Category: Article
ISSN: 1751-8113
DOI: 10.1088/1751-8113/43/33/335302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trapping of continuous-time quantum walk

Trapping of continuous-time quantum walks on Erdös–Rényi graphs

✍ E. Agliari 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 376 KB

We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erdös-Rény graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution,

A bound for the covering time of random

A bound for the covering time of random walks on graphs

✍ JoséLuis Palacios 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Bounds on expected hitting times for a r

Bounds on expected hitting times for a random walk on a connected graph

✍ JoséLuis Palacios 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 719 KB

A Spanning Tree Method for Bounding Hitt

A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

✍ Cogill, Randy; Peng, Cheng 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 270 KB

Lower bounds for covering times for reve

Lower bounds for covering times for reversible Markov chains and random walks on graphs

✍ David J. Aldous 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 334 KB

Covering times of random walks on bounde

Covering times of random walks on bounded degree trees and other graphs

✍ David Zuckerman 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 422 KB