✦ LIBER ✦

Adaptive random walks on the class of Web graphs

✍ Scribed by B. Tadić

Publisher: Springer
Year: 2001
Tongue: English
Weight: 238 KB
Volume: 23
Category: Article
ISSN: 1434-6036
DOI: 10.1007/s100510170071

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Walks on Directed Covers of Graph

Random Walks on Directed Covers of Graphs

✍ Lorenz A. Gilch; Sebastian Müller 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 684 KB

The Einstein Relation for Random Walks o

The Einstein Relation for Random Walks on Graphs

✍ András Telcs 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 185 KB

On the entropy of a class of constrained

On the entropy of a class of constrained random walks

✍ Ido Dayan; Moshe Gitterman; George H. Weiss 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 502 KB

We define and calculate the entropy of some random walks which have two endpoints fixed, and for which displacements are allowed to take all possible values. An example is given in which the entropy can either be increased or decreased by imposing a constraint. It is also shown, by example, that whe

The type-problem on the average for rand

The type-problem on the average for random walks on graphs

✍ R. Burioni; D. Cassi; A. Vezzani 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 KB

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

Random walks on the triangular prism and

Random walks on the triangular prism and other vertex-transitive graphs

✍ A.R.D. van Slijpe 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 703 KB