Related papers: Random shuffles on trees using extended promotion
We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
We study the dynamical properties of a Hopf algebra Markov chain with state space the binary rooted forests with labelled leaves. This Markovian dynamical system describes the core computational process of structure formation and…
Motivated by a host of empirical evidences revealing the bursty character of human dynamics, we develop a model of human activity based on successive switching between an hesitation state and a decision-realization state, with residency…
In this paper we study the dynamics of nonlinear random walks. While typical random walks on networks consist of standard Markov chains whose static transition probabilities dictate the flow of random walkers through the network, nonlinear…
In many dynamical systems in nature, the law of the dynamics changes along with the temporal evolution of the system. These changes are often associated with the occurrence of certain events. The timing of occurrence of these events…
R. Cont and A. de Larrard (SIAM J. Finan. Math, 2013) introduced a tractable stochastic model for the dynamics of a limit order book, computing various quantities of interest such as the probability of a price increase or the diffusion…
We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
We provide a probabilistic analysis of the banker algorithm when transition probabilities may depend on time and space. The transition probabilities evolve, as time goes by, along the trajectory of an ergodic Markovian environment, whereas…
We investigate the translation lengths of group elements that arise in random walks on the isometry groups of Gromov hyperbolic spaces. In particular, without any moment condition, we prove that non-elementary random walks exhibit at least…
We consider a model for a one-sided limit order book proposed by Lakner et al. We show that it can be coupled with a branching random walk and use this coupling to answer a non-trivial question about the long-term behavior of the price. The…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…
We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…
We study the joint occurrence of large values of a Markov random field or undirected graphical model associated to a block graph. On such graphs, containing trees as special cases, we aim to generalize recent results for extremes of Markov…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…
Policy gradient methods are extensively used in reinforcement learning as a way to optimize expected return. In this paper, we explore the evolution of the policy parameters, for a special class of exactly solvable POMDPs, as a…