相关论文: The argmin process of random walks and L\'evy proc…

This paper shows the convergence of adele-valued random walks to an adelic L\'evy process under scaling limits. We use random walks on the $p$-adic numbers to construct random walks initially on the infinite product space, and use survival…

The analytic properties of the Markov operator associated to a random walk are common tools in the study of the behaviour and some probabilistic features related to the walk. In this paper we consider a class of Markov operators which…

Considering quantum random walks, we construct discrete-time approximations of the eigenvalues processes of minors of Hermitian Brownian motion. It has been recently proved by Adler, Nordenstam and van Moerbeke that the process of…

Let $\{X_n\}_{n\in\N}$ be a Markov chain on a measurable space $\X$ with transition kernel $P$ and let $V:\X\r[1,+\infty)$. The Markov kernel $P$ is here considered as a linear bounded operator on the weighted-supremum space $\cB_V$…

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…

This brief manuscript provides an introduction to L\'evy processes and their applications in finance as the random process that drives asset models. Characteristic functions and random variable generators of popular L\'evy processes are…

Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…

It was recently pointed out that identifiability of quantum random walks and hidden Markov processes underlie the same principles. This analogy immediately raises questions on the existence of hidden states also in quantum random walks and…

L\'evy walks are continuous time random walks with spatio-temporal coupling of jump lengths and waiting times, often used to model superdiffusive spreading processes such as animals searching for food, tracer motion in weakly chaotic…

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…

This paper is interested in proving correlation inequalities of the FKG-type for various stochastic processes in continuous time. The pivotal tool which yields these correlation inequalities is an approximation with (possibly conditioned)…

Semi-Levy process is an additive process with periodically stationary increments. In particular, it is a generalization of Levy process. The dichotomy of recurrence and transience of Levy processes is well known, but this is not necessarily…

We derive explicitly the coupling property for the transition semigroup of a L\'{e}vy process and gradient estimates for the associated semigroup of transition operators. This is based on the asymptotic behaviour of the symbol or the…

We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurrent or transient type is studied in [1]. As a result, we…

L\'evy walk process is one of the most effective models to describe superdiffusion, which underlies some important movement patterns and has been widely observed in the micro and macro dynamics. From the perspective of random walk theory,…

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

In this paper our first goal is to give precise definition of the L\'evy bridges with random length. Our second task is to establish the Markov property of this process with respect to its completed natural filtration and thus with respect…

We consider a continuous-time random walk which is defined as an interpolation of a random walk on a point process on the real line. The distances between neighboring points of the point process are i.i.d. random variables in the normal…

Let $(\tau_x)_{x \in \Z^d}$ be i.i.d. random variables with heavy (polynomial) tails. Given $a \in [0,1]$, we consider the Markov process defined by the jump rates $\omega_{x \to y} = {\tau_x}^{-(1-a)} {\tau_y}^a$ between two neighbours $x$…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…