On the Problem of Random Walk without Self-intersections
β Scribed by V. I. Alkhimov
- Publisher
- John Wiley and Sons
- Year
- 1980
- Tongue
- English
- Weight
- 181 KB
- Volume
- 492
- Category
- Article
- ISSN
- 0003-3804
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
Walk of horizontal and vertical axis washers was investigated using rudimentary dynamic models of these washing machine systems. The models predict the qualitatively observed characteristics of walk. The results obtained in this study explain why the vertical axis washer typically exhibits an oscill
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
A method is described for calculating the mean cover time for a particle performing a simple random walk on the vertices of a finite connected graph. The method also yields the variance and generating function of the cover time. A computer program is available which utilises the approach to provide