Related papers: Three steps mixing for general random walks on the…

We study a random walk in a N dimensional hypercube and exhibit results about stopping times when N diverges. The first theorem discusses the time in which two coupling processes spend to meet. A corollary provides a majorant for the…

In the present paper, we study an explicit effect of non-symmetry on asymptotics of the $n$-step transition probability as $n\rightarrow \infty$ for a class of non-symmetric random walks on the triangular lattice. Realizing the triangular…

Random walks in a finite Abelian group $G$ are studied. They use Markov chains with doubly stochastic transition matrices, in a Birkhoff subpolytope ${\cal B}(G)$ associated with the group $G$. It is shown that all future probability…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…

Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds…

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…

The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains…

Several inequalities are proved for the mixing time of discrete-time quantum walks on finite graphs. The mixing time is defined differently than in Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for particular examples…

Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…

Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…

A random walk is performed over a disordered media composed of $N$ sites random and uniformly distributed inside a $d$-dimensional hypercube. The walker cannot remain in the same site and hops to one of its $n$ neighboring sites with a…

Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

In this paper we study random walks on the hypergroup of circles in a finite field of prime order p = 4l + 3. We investigating the behavior of random walks on this hypergroup, the equilibrium distribution and the mixing times. We use two…

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is…

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…

We study a natural notion of decoherence on quantum random walks over the hypercube. We prove that in this model there is a decoherence threshold beneath which the essential properties of the hypercubic quantum walk, such as linear mixing…

We establish bounds on the mixing times of conjugacy-invariant random walks on finite nilpotent groups in terms of the mixing times of their projections onto the abelianization. This comparison framework shows that, in several natural cases…

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…