English
Related papers

Related papers: Full $\Gamma$-expansion of reversible Markov chain…

200 papers

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

Probability · Mathematics 2016-09-07 Cheng-Der Fuh

Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…

Probability · Mathematics 2014-10-03 Alexei Borodin , Vadim Gorin

We consider the maximum entropy Markov chain inference approach to characterize the collective statistics of neuronal spike trains, focusing on the statistical properties of the inferred model. We review large deviations techniques useful…

Neurons and Cognition · Quantitative Biology 2018-08-15 Rodrigo Cofre , Cesar Maldonado , Fernando Rosas

We consider an irreducible continuous time Markov chain on a finite state space and with time periodic jump rates and prove the joint large deviation principle for the empirical measure and flow and the joint large deviation principle for…

Probability · Mathematics 2018-10-17 L. Bertini , R. Chetrite , A. Faggionato , D. Gabrielli

For sequences of non-lattice weakly dependent random variables, we obtain asymptotic expansions for Large Deviation Principles. These expansions, commonly referred to as strong large deviation results, are in the spirit of Edgeworth…

Probability · Mathematics 2020-03-10 Kasun Fernando , Pratima Hebbar

The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…

Statistics Theory · Mathematics 2017-08-25 Daniel Hsu , Aryeh Kontorovich , David A. Levin , Yuval Peres , Csaba Szepesvári

Let $\Delta^o$ be a finite set and, for each probability measure $m$ on $\Delta^o$, let $G(m)$ be a transition probability kernel on $\Delta^o$. Fix $x_0 \in \Delta^o$ and consider the chain $\{X_n, \; n \in \mathbb{N}_0\}$ of…

Probability · Mathematics 2025-07-15 Amarjit Budhiraja , Adam Waterbury , Pavlos Zoubouloglou

Suppose $ E$ is a space with a null-recurrent Markov kernel $ P$. Furthermore, suppose there are infinite particles with variable weights on $ E$ performing a random walk following $ P$. Let $ X_{t}$ be a weighted functional of the position…

Probability · Mathematics 2010-12-01 Souvik Ghosh

In this paper, we consider semi-Markov processes whose transition times and transition probabilities depend on a small parameter $\varepsilon$. Understanding the asymptotic behavior of such processes is needed in order to study the…

Probability · Mathematics 2024-11-08 Leonid Koralov , Ishfaaq Mohammed Imtiyas

This paper develops an optimal Chernoff type bound for the probabilities of large deviations of sums $\sum_{k=1}^n f (X_k)$ where $f$ is a real-valued function and $(X_k)_{k \in \mathbb{Z}_{\ge 0}}$ is a finite state Markov chain with an…

Probability · Mathematics 2019-12-24 Vrettos Moulos , Venkat Anantharam

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the…

Probability · Mathematics 2012-08-17 Peggy Cénac , Brigitte Chauvin , Samuel Herrmann , Pierre Vallois

Let $X_1,X_2,...$ be a sequence of random variables satisfying the distributional recursion $X_1=0$ and $X_n= X_{n-I_n}+1$ for $n=2,3,...$, where $I_n$ is a random variable with values in $\{1,...,n-1\}$ which is independent of…

Probability · Mathematics 2007-11-01 Alex Iksanov , Martin Möhle

We solve the problem of asymptotic behaviour of the renewal measure (Green function) generated by a transient Lamperti's Markov chain $X_n$ in $\mathbf R$, that is, when the drift of the chain tends to zero at infinity. Under this setting,…

Probability · Mathematics 2023-09-06 Denis Denisov , Dmitry Korshunov , Vitali Wachtel

Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete time Markov chain on a finite state space $\Omega $. Denote its transition matrix by $P$. To avoid periodicity issues (and thus ensuring convergence to equilibrium) one…

Probability · Mathematics 2018-01-29 Jonathan Hermon , Yuval Peres

Scaled type Markov renewal processes generalize classical renewal processes: renewal times come from a one parameter family of probability laws and the sequence of the parameters is the trajectory of an ergodic Markov chain. Our primary…

Probability · Mathematics 2015-03-17 Zsolt Pajor-Gyulai , Domokos Szász

We study the asymptotic behaviour of Markov chains $(X_n,\eta_n)$ on $\mathbb{Z}_+ \times S$, where $\mathbb{Z}_+$ is the non-negative integers and $S$ is a finite set. Neither coordinate is assumed to be Markov. We assume a moments bound…

Probability · Mathematics 2014-07-18 Nicholas Georgiou , Andrew R. Wade

We consider a continuous time Markov chain on a countable state space and prove a joint large deviation principle for the empirical measure and the empirical flow, which accounts for the total number of jumps between pairs of states. We…

Probability · Mathematics 2015-01-19 Lorenzo Bertini , Alessandra Faggionato , Davide Gabrielli

We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…

Probability · Mathematics 2025-08-19 Nils Berglund

We consider a Markov chain $(x_n)$ whose kernel is indexed by a scaling parameter $\gamma>0$, refered to as the step size. The aim is to analyze the behavior of the Markov chain in the doubly asymptotic regime where $n\to\infty$ then…

Probability · Mathematics 2017-12-18 Pascal Bianchi , Walid Hachem , Adil Salim

In order to sample from a given target distribution (often of Gibbs type), the Monte Carlo Markov chain method consists in constructing an ergodic Markov process whose invariant measure is the target distribution. By sampling the Markov…

Probability · Mathematics 2015-06-11 Luc Rey-Bellet , Kostantinos Spiliopoulos