English
Related papers

Related papers: A Lower Bound on the Disconnection Time of a Discr…

200 papers

We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random…

Probability · Mathematics 2009-09-25 Alain-Sol Sznitman

We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…

Probability · Mathematics 2024-09-27 Xinyi Li , Yu Liu , Yuanzheng Wang

We consider a random walk on the discrete cylinder $({\mathbb{Z}}/N{\mathbb{Z}})^d\times{\mathbb{Z}}$, $d\geq3$ with drift $N^{-d\alpha}$ in the $\mathbb{Z}$-direction and investigate the large $N$-behavior of the disconnection time…

Probability · Mathematics 2008-08-21 David Windisch

We investigate the disconnection time of a simple random walk in a discrete cylinder with a large finite connected base. In a recent article of A. Dembo and the author it was found that for large $N$ the disconnection time of…

Probability · Mathematics 2009-09-29 Alain-Sol Sznitman

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…

Probability · Mathematics 2009-12-29 Alain-Sol Sznitman

We consider large deviations of the cover time of the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, $d \geq 3$ by simple random walk. We prove a lower bound on the probability that the cover time is smaller than $\gamma\in (0,1)$ times its…

Probability · Mathematics 2025-07-18 Xinyi Li , Jialu Shi , Qiheng Xu

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

Probability · Mathematics 2009-07-06 Alain-Sol Sznitman

We consider simple random walk on Z^d, d bigger or equal to 3. Motivated by the work of A.-S. Sznitman and the author in arXiv:1304.7477 and arXiv:1310.2177, we investigate the asymptotic behaviour of the probability that a large body gets…

Probability · Mathematics 2017-06-20 Xinyi Li

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

Probability · Mathematics 2017-06-19 Alain-Sol Sznitman

Let $\mathcal{T}_n$ be the cover time of two-dimensional discrete torus $\mathbb{Z}^2_n=\mathbb{Z}^2/n\mathbb{Z}^2$. We prove that $\mathbb{P}[\mathcal{T}_n\leq \frac{4}{\pi}\gamma n^2\ln^2 n]=\exp(-n^{2(1-\sqrt{\gamma})+o(1)})$ for…

Probability · Mathematics 2013-11-08 Francis Comets , Christophe Gallesco , Serguei Popov , Marina Vachkovskaia

We consider the vacant set of random interlacements on Z^d, with d bigger or equal to 3, in the percolative regime. Motivated by the large deviation principles obtained in our recent work arXiv:1304.7477, we investigate the asymptotic…

Probability · Mathematics 2014-03-18 Xinyi Li , Alain-Sol Sznitman

We consider the cover time for a simple random walk on the two-dimensional discrete torus of side length $n$. Dembo, Peres, Rosen, and Zeitouni [Ann. Math. 160:433-464, 2004] identified the leading term in the asymptotics for the cover time…

Probability · Mathematics 2020-04-21 Yoshihiro Abe

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 of the vacant set, consisting of the set of vertices not…

Probability · Mathematics 2013-08-05 Augusto Teixeira , David Windisch

We consider the simple random walk conditioned to stay forever in a finite domain $D_N \subset \mathbb{Z}^d, d \geq 3$ of typical size $N$. This confined walk is a random walk on the conductances given by the first eigenvector of the…

Probability · Mathematics 2025-11-13 Nicolas Bouchot

How long does a self-avoiding walk on a discrete $d$-dimensional torus have to be before it begins to behave differently from a self-avoiding walk on $\mathbb{Z}^d$? We consider a version of this question for weakly self-avoiding walk on a…

Probability · Mathematics 2023-05-31 Emmanuel Michta , Gordon Slade

This article investigates the behavior of the continuous-time simple random walk on $\mathbb{Z}^d$, $d \geq 3$. We derive an asymptotic lower bound on the principal exponential rate of decay for the probability that the average value over a…

Probability · Mathematics 2025-07-24 Alberto Chiarini , Maximilian Nitzschner

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

Probability · Mathematics 2007-05-23 Timothy Prescott , Francis Edward Su

We consider the effect of noise on the dynamics generated by volume-preserving maps on a d-dimensional torus. The quantity we use to measure the irreversibility of the dynamics is the dissipation time. We focus on the asymptotic behaviour…

Dynamical Systems · Mathematics 2009-11-10 A. Fannjiang , S. Nonnenmacher , L. Wolowski

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…

Quantum Physics · Physics 2011-07-20 Chaobin Liu , Nelson Petulante

Let $\{X_n\}_{n\in\mathbb{N}}$ be a sequence of i.i.d. random variables in $\mathbb{Z}^d$. Let $S_k=X_1+...+X_k$ and $Y_n(t)$ be the continuous process on $[0,1]$ for which $Y_n(k/n)=S_k/\sqrt{n}$ $k=1,...,n$ and which is linearly…

Probability · Mathematics 2010-09-06 Zsolt Pajor-Gyulai , Domokos Szász
‹ Prev 1 2 3 10 Next ›