English
Related papers

Related papers: Chernoff-Hoeffding Bounds for Markov Chains: Gener…

200 papers

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

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian matrix-valued…

Machine Learning · Statistics 2020-10-30 Jiezhong Qiu , Chi Wang , Ben Liao , Richard Peng , Jie Tang

We build optimal exponential bounds for the probabilities of large deviations of sums \sum_{k=1}^nf(X_k) where (X_k) is a finite reversible Markov chain and f is an arbitrary bounded function. These bounds depend only on the stationary mean…

Probability · Mathematics 2007-05-23 Carlos A. Leon , Francois Perron

We introduce a unified operator-theoretic framework for analyzing mixing times of finite-state ergodic Markov chains that applies to both reversible and non-reversible dynamics. The central object in our analysis is the projected transition…

Probability · Mathematics 2025-11-05 Muhammad Abdullah Naeem

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ having increments $(1,0)$, $(-1,1)$, $(0,-1)$ with jump probabilities $\lambda(M_k)$, $\mu_1(M_k)$, and $\mu_2(M_k)$ where $M$ is an irreducible aperiodic finite state Markov…

Probability · Mathematics 2019-09-17 Fatma Başoğlu Kabran , Ali Devin Sezer

This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time $t_{\text{mix}}$ of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from…

Machine Learning · Computer Science 2015-11-04 Daniel Hsu , Aryeh Kontorovich , Csaba Szepesvári

Let $\{Y_i\}_{i=1}^{\infty}$ be a stationary reversible Markov chain with state space $[N]$, let $(X, \| \cdot \|)$ be a real-valued Banach space and let $f_1, \ldots, f_n: [N] \rightarrow X$ be functions with mean $0$ such that $\|f_i(v)\|…

Probability · Mathematics 2026-03-02 Shravas Rao

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

Let $\{W_t\}_{t=1}^{\infty}$ be a finite state stationary Markov chain, and suppose that $f$ is a real-valued function on the state space. If $f$ is bounded, then Gillman's expander Chernoff bound (1993) provides concentration estimates for…

Probability · Mathematics 2019-06-19 Assaf Naor , Shravas Rao , Oded Regev

We address the problem of estimating the mixing time $t_{\mathsf{mix}}$ of an arbitrary ergodic finite-state Markov chain from a single trajectory of length $m$. The reversible case was addressed by Hsu et al. [2019], who left the general…

Statistics Theory · Mathematics 2022-08-17 Geoffrey Wolfer , Aryeh Kontorovich

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a random walk on an expander, confirming a conjecture due to Wigderson and Xiao. Our proof is based on a new multi-matrix extension of the Golden-Thompson…

Probability · Mathematics 2018-04-18 Ankit Garg , Yin Tat Lee , Zhao Song , Nikhil Srivastava

This paper studies Hoeffding's inequality for Markov chains under the generalized concentrability condition defined via integral probability metric (IPM). The generalized concentrability condition establishes a framework that interpolates…

Machine Learning · Statistics 2023-10-06 Hao Chen , Abhishek Gupta , Yin Sun , Ness Shroff

Consider a sequence of continuous-time irreducible reversible Markov chains and a sequence of initial distributions, $\mu_n$. The sequence is said to exhibit $\mu_n$-cutoff if the convergence to stationarity in total variation distance is…

Probability · Mathematics 2018-02-27 Jonathan Hermon

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 prove deviation bounds for the random variable $\sum_{i=1}^{n} f_i(Y_i)$ in which $\{Y_i\}_{i=1}^{\infty}$ is a Markov chain with stationary distribution and state space $[N]$, and $f_i: [N] \rightarrow [-a_i, a_i]$. Our bound improves…

Probability · Mathematics 2019-04-02 Shravas Rao

We show the following. \begin{theorem} Let $M$ be an finite-state ergodic time-reversible Markov chain with transition matrix $P$ and conductance $\phi$. Let $\lambda \in (0,1)$ be an eigenvalue of $P$. Then, $$\phi^2 + \lambda^2 \leq 1$$…

Discrete Mathematics · Computer Science 2010-09-10 Girish Varma

We consider Markov chain with spectral gap in $L^2$ space. Assume that $f$ is a bounded function. Then the probabilities of large deviations of average along trajectory satisfy Hoeffding's-type inequalities. These bounds depend only on the…

Probability · Mathematics 2013-06-14 Błażej Miasojedow

Motivated by a derandomization of Markov chain Monte Carlo (MCMC), this paper investigates deterministic random walks, which is a deterministic process analogous to a random walk. While there are several progresses on the analysis of the…

Discrete Mathematics · Computer Science 2015-08-17 Takeharu Shiraga , Yukiko Yamauchi , Shuji Kijima , Masafumi Yamashita

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

In this paper, we present a novel iterative Monte Carlo method for approximating the stationary probability of a single state of a positive recurrent Markov chain. We utilize the characterization that the stationary probability of a state…

Data Structures and Algorithms · Computer Science 2015-12-11 Christina E. Lee , Asuman Ozdaglar , Devavrat Shah
‹ Prev 1 2 3 10 Next ›