相关论文: Random Walks on the Generalized Symmetric Group: C…

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

We construct a statistic-swapping involution on the Cartesian product of the generalized symmetric group $S(k,n)$ with the symmetric group $S_{kn}$, which swaps the number of fixed points in the generalized symmetric group element with the…

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

In this paper we study the one-sided shift operator on a state space defined by a finite alphabet. Using a scheme developed by Walters [13], we prove that the sequence of iterates of the transfer operator converges under square summability…

Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…

We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…

Recently Lubetzky and Peres showed that simple random walks on a sequence of $d$-regular Ramanujan graphs $G_n=(V_n,E_n)$ of increasing sizes exhibit cutoff in total variation around the diameter lower bound $\frac{d}{d-2}\log_{d-1}|V_n| $.…

Let $\nu$ be a probability distribution over the semi-group of square matrices of size $d \ge 2$ over a locally compact field $\mathbb{K}$, \textit{e.g.} $\mathbb{R}$. We consider the random walk $\overline{\gamma}_n :=…

Let $\xi_1, \xi_2,\ldots$ be a sequence of independent and identically distributed random variables with zero mean, finite second moment and regularly varying right distribution tail. Motivated by a stop-loss insurance model, we consider a…

We consider a generalized riffle shuffle on the colored permutation group $G_{p, n}$ and derive a determinantal formula for the probability of finding descents at given positions, proof of which is based on the bijection between the set of…

Since the early work of Richard Stanley, it has been observed that several permutation statistics have a remarkable property with respect to shuffles of permutations. We formalize this notion of a shuffle-compatible permutation statistic…

We consider two continuous-time generalizations of conservative random walks introduced in [J.Englander and S.Volkov (2022)], an orthogonal and a spherically-symmetrical one; the latter model is known as {\em random flights}. For both…

Completing a strategy of Gou\"ezel and Lalley, we prove a local limit theorem for the random walk generated by any symmetric finitely supported probability measure on a non-elementary Gromov-hyperbolic group: denoting by $R$ the inverse of…

Consider a uniformly chosen random reduced decomposition of the longest element in the symmetric group. It is known that the location of the first transposition in this decomposition converges to the semicircle distribution. In this note we…

We establish a sharp uniform-in-time error estimate for the Stochastic Gradient Langevin Dynamics (SGLD), which is a widely-used sampling algorithm. Under mild assumptions, we obtain a uniform-in-time $O(\eta^2)$ bound for the KL-divergence…

We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which…

This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…

This paper studies the random walk on the hypercube $(\mathbb{Z}/2\mathbb{Z})^n$ which at each step flips $k$ randomly chosen coordinates. We prove that the mixing time for this walk is of order $\frac{n}{k} \log n$. We also prove that if…