English
Related papers

Related papers: Markov chains with heavy-tailed increments and asy…

200 papers

General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic…

Probability · Mathematics 2013-01-08 Yong-Hua Mao , Yan-Hong Song

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…

Probability · Mathematics 2016-12-02 Peggy Cénac , Arnaud Le Ny , Basile De Loynes , Yoann Offret

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…

Probability · Mathematics 2022-05-04 Iddo Ben-Ari , Behrang Forghani

We prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above…

Probability · Mathematics 2019-05-14 Aleksandar Mijatović , Vladislav Vysotsky

We characterize recurrence and transience of nonnegative multivariate autoregressive processes of order one with random contractive coefficient matrix, of subcritical multitype Galton-Watson branching processes in random environment with…

Probability · Mathematics 2016-10-18 Martin P. W. Zerner

Consider a Lamperti-Kiu Markov additive process $(J_t,\xi_t:t\geq0)$ on $\{+,-\}\times\mathbb{R}\cup\infty$ where $J$ is the modulating Markov chain component. First, we study the finiteness of the exponential functional and then consider…

Probability · Mathematics 2020-11-23 Larbi Alili , David Woodford

We consider topological Markov chains (also called Markov shifts) on countable graphs. We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an…

Dynamical Systems · Mathematics 2019-01-03 Sylvie Ruette

We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…

Probability · Mathematics 2018-11-20 Julien Brémont

We study a random walk (Markov chain) in an unbounded planar domain whose boundary is described by two curves of the form $x_2 = a^+ x_1^{\beta^+}$ and $x_2 = -a^- x_1^{\beta^-}$, with $x_1 \geq 0$. In the interior of the domain, the random…

Probability · Mathematics 2022-02-15 Mikhail V. Menshikov , Aleksandar Mijatović , Andrew R. Wade

In this paper we study the long term evolution of a continuous time Markov chain formed by two interacting birth-and-death processes. The interaction between the processes is modelled by transition rates which are functions with suitable…

Probability · Mathematics 2017-03-23 Mikhail Menshikov , Vadim Shcherbakov

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

Probability · Mathematics 2018-01-19 Riddhipratim Basu , Jonathan Hermon , Yuval Peres

For a class of irreducible Markov chains with an infinitely countable set of states, we establish a new verifiable necessary and sufficient condition for recurrence and transience. We show that if one of the basic assumptions is not…

Probability · Mathematics 2024-10-08 Vyacheslav M. Abramov

The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be…

Probability · Mathematics 2024-11-12 Luis Fredes , Jean-François Marckert

We consider the tail distribution of the edge cover time of a specific non-Markov process, $\delta$ once-reinforced random walk, on finite connected graphs, whose transition probability is proportional to weights of edges. Here the weights…

Probability · Mathematics 2025-05-09 Xiangyu Huang , Yong Liu , Kainan Xiang

This paper investigates tail asymptotics of stationary distributions and quasi-stationary distributions (QSDs) of continuous-time Markov chains on subsets of the non-negative integers. Based on the so-called flux-balance equation, we…

Probability · Mathematics 2023-08-16 Chuang Xu , Mads Christian Hansen , Carsten Wiuf

We propose some backward-forward martingale decompositions for functions of reversible Markov chains. These decompositions are used to prove the functional CLT for reversible Markov chains with asymptotically linear variance of partial…

Probability · Mathematics 2018-01-16 Martial Longla

We consider a sequence of Markov chains $(\mathcal X^n)_{n=1,2,...}$ with $\mathcal X^n = (X^n_\sigma)_{\sigma\in\mathcal T}$, indexed by the full binary tree $\mathcal T = \mathcal T_0 \cup \mathcal T_1 \cup ...$, where $\mathcal T_k$ is…

Probability · Mathematics 2014-06-17 Peter Czuppon , Peter Pfaffelhuber

We examine two analytical characterisation of the metastable behavior of a Markov chain. The first one expressed in terms of its transition probabilities, and the second one in terms of its large deviations rate functional. Consider a…

Probability · Mathematics 2022-07-07 L. Bertini , D. Gabrielli , C. Landim

Consider a Markov process \omega_t at equilibrium and some event C (a subset of the state-space of the process). A natural measure of correlations in the process is the pairwise correlation \Pr[\omega_0,\omega_t \in C] - \Pr[\omega_0 \in…

Probability · Mathematics 2012-08-24 Alan Hammond , Elchanan Mossel , Gábor Pete

We consider the Markov chain $\{X_n^x\}_{n=0}^\infty$ on $\R^d$ defined by the stochastic recursion $X_{n}^{x}=\p_{\theta_{n}}(X_{n-1}^{x})$, starting at $x\in\R^d$, where $\theta_{1}, \theta_{2},...$ are i.i.d. random variables taking…

Probability · Mathematics 2010-11-09 Mariusz Mirek