𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The mean number of sites visited by a pinned random walk

✍ Scribed by Kôhei Uchiyama

Publisher
Springer-Verlag
Year
2008
Tongue
French
Weight
261 KB
Volume
261
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of distinct sites visited
On the number of distinct sites visited by a random walk
✍ M. D. Donsker; S. R. S. Varadhan 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 727 KB

In the expression for a(?), M is a symmetric measure on the unit ball means that the support of M spans &. Let {rjl} be the n-step transition probabilities. It follows from hypotheses (i) and (ii) above that for any j e Z d there exists an no such that .rrYu>O. Moreover, from hypothesis (ii) it fol

A note on the last new vertex visited by
A note on the last new vertex visited by a random walk
✍ Lászlo Lovász; Peter Winkler 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract A “cover tour” of a connected graph __G__ from a vertex __x__ is a random walk that begins at __x__, moves at each step with equal probability to any neighbor of its current vertex, and ends when it has hit every vertex of __G__. The cycle __C__~n~ is well known to have the curious prop