相关论文: Separation cutoffs for random walk on irreducible …

The range, local times, and periodicity of symmetric, weakly asymmetric and asymmetric random walks at the time of exit from a strip with $N$ locations are considered. Several results on asymptotic distributions are obtained.

We study an homogeneous irreducible markovian random walk in a square lattice of arbitrary dimension, with an antisymmetric perturbation acting only in one point. We compute exactly spatial correction to the diffusive behaviour in the…

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…

Non-trivial linear bounds are obtained for the displacement of a random walk in a dynamic random environment given by a one-dimensional simple symmetric exclusion process in equilibrium. The proof uses an adaptation of multiscale…

By viewing the $N$-simplex as the set of positions of $N-1$ ordered particles on the unit interval, the adjacent walk is the continuous time Markov chain obtained by updating independently at rate 1 the position of each particle with a…

We consider a finite range symmetric exclusion process on the integer lattice in any dimension. We interpret it as a non-elliptic time-dependent random conductance model by setting conductances equal to one over the edges with end points…

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

Let $G$ be a countable group whose action on a metric space $X$ involves a contracting isometry. This setting naturally encompasses groups acting on Gromov hyperbolic spaces, Teichm{\"u}ller space, Culler-Vogtmann Outer space and CAT(0)…

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.

Using the results obtained by the non commutative geometry techniques applied to the Harper equation, we derive the areas distribution of random walks of length $ N $ on a two-dimensional square lattice for large $ N $, taking into account…

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by…

We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom…

We make a connection between the continuous time and lazy discrete time Markov chains through the comparison of cutoffs and mixing time in total variation distance. For illustration, we consider finite birth and death chains and provide a…

Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…

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…

Several stochastic processes modeling molecular motors on a linear track are given by random walks (not necessarily Markovian) on quasi 1d lattices and share a common regenerative structure. Analyzing this abstract common structure, we…