相关论文: Total variation bound for Kac's random walk

In this paper, we present a detailed proof for the exhibition of a cutoff for the one-sided transposition (OST) shuffle on the generalized symmetric group $G_{m,n}$. Our work shows that based on techniques for $m \leq 2$ proven by…

For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to…

For a symmetric random walk in $Z^2$ with $2+\delta$ moments, we represent $|\mathcal{R}(n)|$, the cardinality of the range, in terms of an expansion involving the renormalized intersection local times of a Brownian motion. We show that for…

In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…

To analyze the security of code-based cryptosystems, the smoothing parameter, which is closely related to the total variation distance of codes, has been investigated. While previous studies have bounded this distance using the Fourier…

We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the…

We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…

Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

In this paper, we study random walks $g_n=f_{n-1}\cdots f_0$ on the group $\mathrm{Homeo}(S^1)$ of the homeomorphisms of the circle, where the homeomorphisms $f_k$ are chosen randomly, independently, with respect to a same probability…

Motivated by a derandomization of Markov chain Monte Carlo (MCMC), this paper investigates deterministic random walks, which is a deterministic process analogous to a random walk. While there are several progresses on the analysis of the…

In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…

Let $\{A, B, C\}$ be a partition of a sample space $\Omega$. For a random walk $S_n = x + \sum_{j=1}^n X_j$ starting at $x \in A$, we find estimates for the Green's function $G_{A \cup B}(x,y)$ and the hitting time $E^x(T_C)$ for $x, y \in…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

Consider $(1,2)$ random walk in random environment $\{X_n\}_{n\ge0}.$ In each step, the walk jumps at most a distance $2$ to the right or a distance $1$ to the left. For the walk transient to the right, it is proved that almost surely…

We obtain estimates for large and moderate deviations for the capacity of the range of a random walk on $\mathbb{Z}^d$, in dimension $d\ge 5$, both in the upward and downward directions. The results are analogous to those we obtained for…

We analyse a random walk on the ring of integers mod $n$, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of $n$ we prove the…

We consider a random walk on the hyperoctahedral group $B_n$ generated by the signed permutations of the forms $(i,n)$ and $(-i,n)$ for $1\leq i\leq n$. We call this the flip-transpose top with random shuffle on $B_n$. We find the spectrum…

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

We consider a discrete-time random motion, Markov chain on the Poincar\'{e} disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random…