English
Related papers

Related papers: A Hoeffding inequality for Markov chains

200 papers

We study continuous-time Markov chains on the non-negative integers under mild regularity conditions (in particular, the set of jump vectors is finite and both forward and backward jumps are possible). Based on the so-called flux balance…

Probability · Mathematics 2024-11-26 Mads Chr Hansen , Carsten Wiuf , Chuang Xu

In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of an Harris recurrent Markov chain on an arbitrary under drift and minorisation conditions implying ergodicity at a sub-geometric rate. These…

Probability · Mathematics 2007-05-23 Randal Douc , Eric Moulines , Philippe Soulier

Consider a Markov chain $(X_n)_{n\geqslant 0}$ with values in the state space $\mathbb X$. Let $f$ be a real function on $\mathbb X$ and set $S_0=0,$ $S_n = f(X_1)+\cdots + f(X_n),$ $n\geqslant 1$. Let $\mathbb P_x$ be the probability…

Probability · Mathematics 2016-07-28 Ion Grama , Ronan Lauvergnat , Émile Le Page

Assume that one observes the $k$th, $2k$th$,\ldots,nk$th value of a Markov chain $X_{1,h},\ldots,X_{nk,h}$. That means we assume that a high frequency Markov chain runs in the background on a very fine time grid but that it is only observed…

Statistics Theory · Mathematics 2014-03-17 Valentin Konakov , Enno Mammen , Jeannette Woerner

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

In this paper, we propose a new Markov chain which generalizes random-to-random shuffling on permutations to random-to-random shuffling on linear extensions of a finite poset of size $n$. We conjecture that the second largest eigenvalue of…

Probability · Mathematics 2017-03-01 Arvind Ayyer , Anne Schilling , Nicolas M. Thiéry

We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…

Probability · Mathematics 2007-05-23 Richard F. Bass , Takashi Kumagai

The paper considers a stochastic differential equation of Duffing type with Markov coefficients. The existence of unpredictable solutions is considered. The unpredictability is a property of bounded functions characterized by unbounded…

Chaotic Dynamics · Physics 2023-03-31 Marat Akhmet , Madina Tleubergenova , Akylbek Zhamanshin

In this work, we consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Stochastic Differential Equation. The chain we study is a unified framework for theoretical analysis.…

Optimization and Control · Mathematics 2024-04-02 Aleksei Ustimenko , Aleksandr Beznosikov

We establish convergence to an invariant measure as time tends to infinity, for a large class of (possibly non-Markovian) stochastic volatility models. Our arguments are based on a novel coupling idea for Markov chains which also extends to…

Probability · Mathematics 2021-08-30 Balázs Gerencsér , Miklós Rásonyi

We consider evaluation of proper posterior distributions obtained from improper prior distributions. Our context is estimating a bounded function $\phi$ of a parameter when the loss is quadratic. If the posterior mean of $\phi$ is…

Statistics Theory · Mathematics 2008-11-10 Morris L. Eaton , James P. Hobert , Galin L. Jones , Wen-Lin Lai

We address the problem of community detection in networks by introducing a general definition of Markov stability, based on the difference between the probability fluxes of a Markov chain on the network at different time scales. The…

Physics and Society · Physics 2020-05-05 Aurelio Patelli , Andrea Gabrielli , Giulio Cimini

Given a unichain Markov reward process (MRP), we provide an explicit expression for the bias values in terms of mean first passage times. This result implies a generalization of known Markov chain perturbation bounds for the stationary…

Probability · Mathematics 2024-08-09 Ronald Ortner

The effect of perturbations of parameters for uniquely convergent imprecise Markov chains is studied. We provide the maximal distance between the distributions of original and perturbed chain and maximal degree of imprecision, given the…

Probability · Mathematics 2022-09-29 Damjan Škulj

Let $M_n= \fsu X1n$ be a sum of independent random variables such that $ X_k\leq 1$, $\E X_k =0$ and $\E X_k^2=\s_k^2$ for all $k$. Hoeffding 1963, Theorem 3, proved that $$\P{M_n \geq nt}\leq H^n(t,p),\quad H(t,p)= \bgl(1+qt/p\bgr)^{p +qt}…

Probability · Mathematics 2011-11-29 Vidmantas Bentkus , Tomas Juškevičius

We derive some key extremal features for $k$th order Markov chains that can be used to understand how the process moves between an extreme state and the body of the process. The chains are studied given that there is an exceedance of a…

Statistics Theory · Mathematics 2023-01-27 Ioannis Papastathopoulos , Adrian Casey , Jonathan A. Tawn

It is proved that the limit of the normalized rate-distortion functions of block independent approximations of an irreducible, aperiodic Markoff chain is independent of the initial distribution of the Markoff chain and thus, is also equal…

Information Theory · Computer Science 2018-03-28 Mukul Agarwal

We observe that the technique of Markov contraction can be used to establish measure concentration for a broad class of non-contracting chains. In particular, geometric ergodicity provides a simple and versatile framework. This leads to a…

Probability · Mathematics 2013-12-06 Aryeh Kontorovich , Roi Weiss

We prove central limit theorems, Berry-Esseen type theorems, almost sure invariance principles, large deviations and Livsic type regularity for partial sums of the form $S_n=\sum_{j=0}^{n-1}f_j(...,X_{j-1},X_j,X_{j+1},...)$, where $(X_j)$…

Probability · Mathematics 2025-10-14 Yeor Hafouta

Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…

Social and Information Networks · Computer Science 2012-11-01 J. Ray , A. Pinar , C. Seshadhri