Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Sznitman (2007)
Vacant Set of Random Interlacements and PercolationarXiv: Probability
J. Hammersley (1980)
PercolationAdvances in Applied Probability, 12
V. Sidoravicius, A. Sznitman (2008)
Percolation for the vacant set of random interlacementsCommunications on Pure and Applied Mathematics, 62
E. Csáki, P. Révész (1983)
Strong invariance for local timesZeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 62
A. Dembo (2006)
321Probab. Theory Relat. Fields, 136
I. Benjamini, A. Sznitman (2006)
Giant component and vacant set for random walk on a discrete torusJournal of the European Mathematical Society, 10
A. Sznitman (2003)
On new examples of ballistic random walks in random environmentAnnals of Probability, 31
N. Eisenbaum (1990)
Un théorème de Ray-Knight lié au supremum des temps locaux browniensProbability Theory and Related Fields, 87
Alain-Sol Sznitman Departement Mathematik ETH Zürich CH 8092 Zürich Switzerland e-mail: sznitman@math.ethz
I. Benjamini (2008)
133J. Eur. Math. Soc., 10
A. Sznitman (2008)
Random walks on discrete cylinders and random interlacementsProbability Theory and Related Fields, 145
F. Olver (1974)
Asymptotics and Special Functions
Torgny Lindvall (1992)
Lectures on the Coupling Method
E. Montroll (1956)
Random Walks in Multidimensional Spaces, Especially on Periodic LatticesJournal of The Society for Industrial and Applied Mathematics, 4
A. Sznitman (2007)
How universal are asymptotics of disconnection times in discrete cylindersAnnals of Probability, 36
H. Kesten (1982)
Percolation theory for mathematicians
E. Csáki (1983)
263Z. für Wahrsch. verw. Geb., 62
(1991)
Intersections of Random Walks. Birkhäuser, Basel
(1982)
Distribution of integral functionals of the Brownian motion
A. Dembo, A. Sznitman (2006)
On the disconnection of a discrete cylinder by a random walkProbability Theory and Related Fields, 136
[We study the asymptotic behavior for large N of the disconnection time TN of simple random walk on the discrete cylinder (ℤ/Nℤ)d×ℤ. When d is sufficiently large, we are able to substantially improve the lower bounds on TN previously derived in [3], for d≥2. We show here that the laws of N2d/TN are tight.]
Published: Jan 1, 2008
Keywords: Disconnection time; random walk; discrete cylinders; 60J10; 60K35; 82C41
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.