English
Related papers

Related papers: Limitations on intermittent forecasting

200 papers

Let $P$ be the transition matrix of a finite, irreducible and reversible Markov chain. We say the continuous time Markov chain $X$ has transition matrix $P$ and speed $\lambda$ if it jumps at rate $\lambda$ according to the matrix $P$. Fix…

Probability · Mathematics 2015-06-26 Louigi Addario-Berry , Roberto I. Oliveira , Yuval Peres , Perla Sousi

We study the limit behaviour of a generally non-linear ordinary differential equation whose solution is a superadditive generalisation of a stochastic matrix, and provide necessary and sufficient conditions for this solution to be ergodic,…

Probability · Mathematics 2016-09-21 Jasper De Bock

We study some regularity properties in locally stationary Markov models which are fundamental for controlling the bias of nonparametric kernel estimators. In particular, we provide an alternative to the standard notion of derivative process…

Statistics Theory · Mathematics 2018-12-07 Lionel Truquet

The setting is a stationary, ergodic time series. The challenge is to construct a sequence of functions, each based on only finite segments of the past, which together provide a strongly consistent estimator for the conditional probability…

Probability · Mathematics 2008-06-19 G. Morvai , S. Yakowitz , L. Gyorfi

Consider a stochastic process $\{X(t)\}$ on a finite state space $ {\sf X}=\{1,\dots, d\}$. It is conditionally Markov, given a real-valued `input process' $\{\zeta(t)\}$. This is assumed to be small, which is modeled through the scaling,…

Performance · Computer Science 2018-09-18 Yue Chen , Ana Bušić , Sean Meyn

We study the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…

Probability · Mathematics 2022-06-28 Thomas Krak

We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary…

Probability · Mathematics 2023-01-04 John Rhodes , Anne Schilling

We study one-sided and $\alpha$-correct sequential hypothesis testing for data generated by an ergodic Markov chain. The null hypothesis is that the unknown transition matrix belongs to a prescribed set $P$ of stochastic matrices, and the…

Statistics Theory · Mathematics 2026-02-20 Alhad Sethi , Kavali Sofia Sagar , Shubhada Agrawal , Debabrota Basu , P. N. Karthik

Time-homogeneous Markov chains are often used as disease progression models in studies of cost-effectiveness and optimal decision-making. Maximum likelihood estimation of these models can be challenging when data are collected at a time…

Methodology · Statistics 2022-09-26 Duncan Ermini Leaf

In this paper we develop a statistical estimation technique to recover the transition kernel $P$ of a Markov chain $X=(X_m)_{m \in \mathbb N}$ in presence of censored data. We consider the situation where only a sub-sequence of $X$ is…

Statistics Theory · Mathematics 2014-05-05 Flavia Barsotti , Yohann De Castro , Thibault Espinasse , Paul Rochet

Let $(X_n \colon n\in\Z)$ be a two-sided recurrent Markov chain with fixed initial state $X_0$ and let $\nu$ be a probability measure on its state space. We give a necessary and sufficient criterion for the existence of a non-randomized…

Probability · Mathematics 2015-06-11 Peter Morters , Istvan Redl

In this paper, we consider a general class of two-time-scale Markov chains whose transition rate matrix depends on a parameter $\lambda>0$. We assume that some transition rates of the Markov chain will tend to infinity as…

Probability · Mathematics 2015-07-10 Chen Jia

We study stochastic approximation procedures for approximately solving a $d$-dimensional linear fixed point equation based on observing a trajectory of length $n$ from an ergodic Markov chain. We first exhibit a non-asymptotic bound of the…

Optimization and Control · Mathematics 2024-05-14 Wenlong Mou , Ashwin Pananjady , Martin J. Wainwright , Peter L. Bartlett

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

In this paper we consider the convergence of the conditional entropy to the entropy rate for Markov chains. Convergence of certain statistics of long range dependent processes, such as the sample mean, is slow. It has been shown in Carpio…

Probability · Mathematics 2021-10-29 Andrew Feutrill , Matthew Roughan

The convergence rate of a Markov chain to its stationary distribution is typically assessed using the concept of total variation mixing time. However, this worst-case measure often yields pessimistic estimates and is challenging to infer…

Statistics Theory · Mathematics 2026-02-06 Geoffrey Wolfer , Pierre Alquier

In this paper, we are interested in investigating the perturbation bounds for the stationary distributions for discrete-time or continuous-time Markov chains on a countable state space. For discrete-time Markov chains, two new norm-wise…

Probability · Mathematics 2012-08-27 Yuanyuan Liu

We extend Hoeffding's lemma to general-state-space and not necessarily reversible Markov chains. Let $\{X_i\}_{i \ge 1}$ be a stationary Markov chain with invariant measure $\pi$ and absolute spectral gap $1-\lambda$, where $\lambda$ is…

Statistics Theory · Mathematics 2018-07-19 Jianqing Fan , Bai Jiang , Qiang Sun

We obtain pointwise ergodic theorems with rate under conditions expressed in terms of the convergence of series involving $\|\sum_{k=1} ^nf\circ \theta^k\|_2$, improving previous results. Then, using known results on martingale…

Probability · Mathematics 2009-04-02 Christophe Cuny

We establish, for various scenarios, whether or not interruptible exact stationary sampling is possible when a finite-state Markov chain can only be viewed passively. In particular, we prove that such sampling is not possible using a single…

Probability · Mathematics 2007-06-13 Keith Crank , James Allen Fill