Related papers: Regular sequences and random walks in affine build…

We study a natural construction of a general class of inhomogeneous quantum walks (namely walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

We introduce a construction that gives rise to a variety of "geometric" finite random graphs, and describe connections to the Poisson boundary, Naim's kernel, and Sznitman's random interlacements.

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.…

We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine…

We consider recurrent diffusive random walks on a strip. We present constructive conditions on Green functions of finite sub-domains which imply a Central Limit Theorem with polynomial error bound, a Local Limit Theorem, and mixing of…

We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs…

We theoretically study the transport properties of self-propelled particles on complex structures, such as motor proteins on filament networks. A general master equation formalism is developed to investigate the persistent motion of…

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.

For one-dimensional simple random walk in a general i.i.d. scenery and its limiting process we construct a coupling with explicit rate of approximation extending a recent result for Gaussian sceneries due to Khoshnevisan and Lewis.…

Let $(X, \cal B, \nu)$ be a probability space and let $\Gamma$ be a countable group of $\nu$-preserving invertible maps of $X$ into itself. To a probability measure $\mu$ on $\Gamma$ corresponds a random walk on $X$ with Markov operator $P$…

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

We study large deviations for random walks on stratified (Carnot) Lie groups. For such groups, there is a natural collection of vectors which generates their Lie algebra, and we consider random walks with increments in only these…

We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…

We consider general transformations of random walks on groups determined by Markov stopping times and prove that the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…

We show that the occurrence of chaotic diffusion in a typical class of time-delayed systems with linear instantaneous and nonlinear delayed term can be well described by an anti-persistent random walk. We numerically investigate the…

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…