Related papers: Random walks on quasisymmetric functions
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…
In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…
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…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
We establish a novel type of connection between random walks and analytic number theory. Working with a random walk on the circle group $\mathbb{R}/\mathbb{Z}$ in which each step is a random integer multiple of a given quadratic irrational…
We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…
Surprisingly the looking natural random walk leading to Brownian motion occurs to be often biased in a very subtle way: usually refers to only approximate fulfillment of thermodynamical principles like maximizing uncertainty. Recently, a…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…
We introduce asymptotic R\'enyi entropies as a parameterized family of invariants for random walks on groups. These invariants interpolate between various well-studied properties of the random walk, including the growth rate of the group,…
We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…
A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability $\alpha$, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen…
We focus on the algebraic area probability distribution of planar random walks on a square lattice with $m_1$, $m_2$, $l_1$ and $l_2$ steps right, left, up and down. We aim, in particular, at the algebraic area generating function…
The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…
Quantum random walks are constructed on operator spaces with the aid of matrix-space lifting, a type of ampliation intermediate between those provided by spatial and ultraweak tensor products. Using a form of Wiener-Ito decomposition, a…
We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…
For any pseudo-Anosov diffeomorphism on a closed orientable surface $S$ of genus greater than one, it is known by the work of Bers and Thurston that the topological entropy agrees with the translation distance on the Teichm\"uller space…
Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…