activity
20072010
most citedOn the fragmentation of a torus by random walk

53 citations · 134 across the 8 of their papers we have counts for

collaborators

8 papers

math.PR2010★ 43 cited

Giant vacant component left by a random walk in a random d-regular graph

Jiri Cerny, Augusto Teixeira, David Windisch

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include ran…

math.PR2010★ 30 cited

Percolation in the vacant set of Poisson cylinders

Johan Tykesson, David Windisch

We consider a Poisson point process on the space of lines in R^d, where a multiplicative factor u>0 of the intensity measure determines the density of lines. Each line in the proce…

math.PR2010★ 53 cited

On the fragmentation of a torus by random walk

Augusto Teixeira, David Windisch

We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties o…

math.PR2010

Entropy of random walk range on uniformly transient and on uniformly recurrent graphs

David Windisch

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quan…

math.PR2009★ 2 cited

Random walks on discrete cylinders with large bases and random interlacements

David Windisch

Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is…

math.PR2008

Logarithmic components of the vacant set for random walk on a discrete torus

David Windisch

This work continues the investigation, initiated in a recent work by Benjamini and Sznitman, of percolative properties of the set of points not visited by a random walk on the disc…