## Abstract We consider a simple random walk on a discrete torus \input amssym $({\Bbb Z}/N{\Bbb Z})^d$ with dimension __d__ ≥ 3 and large side length __N__. For a fixed constant __u__ ≥ 0, we study the percolative properties of the vacant set, consisting of the set of vertices not visited by the r
A note on the last new vertex visited by a random walk
✍ Scribed by Lászlo Lovász; Peter Winkler
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 200 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
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 property that a cover tour from any vertex is equally likely to end at any other vertex; the complete graph K~n~ shares this property, trivially, by symmetry. Ronald L. Graham has asked whether there are any other graphs with this property; we show that there are not. © 1993 John Wiley & Sons, Inc.
📜 SIMILAR VOLUMES
Let 1 2n be the set of paths with 2n steps of unit length in Z 2 , which begin and end at (0, 0). For # # 1 2n , let area(#) # Z denote the oriented area enclosed by #. We show that for every positive even integer k, there exists a rational function R k with integer coefficients, such that: We calc
Singh (1999) suggested a safe randomized response technique to deal with quantitative sensitive characters through Moors' (1971) strategy, but the variance and percent relative efficiency of the estimator of population mean seem to be incorrect. This note corrects them, and finds Singh's strategy is