✦ LIBER ✦

The circle homogeneously covered by random walk on Z2

✍ Scribed by Peter Auer

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 244 KB
Volume: 9
Category: Article
ISSN: 0167-7152
DOI: 10.1016/0167-7152(90)90032-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the area of the circles covered by a

On the area of the circles covered by a random walk

✍ P. Erdös; P. Révész 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 401 KB

On the Distribution of the Area Enclosed

On the Distribution of the Area Enclosed by a Random Walk onZ2

✍ James A Mingo; Alexandru Nica 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 475 KB

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

On the fragmentation of a torus by rando

On the fragmentation of a torus by random walk

✍ Augusto Teixeira; David Windisch 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

## 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

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

On describing the steady absorption of b

On describing the steady absorption of brownian particles by a restricted random walk

✍ K.Razi Naqvi; K.J. Mork; S. Waldenstrøm 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 312 KB