English
Related papers

Related papers: Subgeometrically ergodic autoregressions

200 papers

In this paper, we study a notion of local stationarity for discrete time Markov chains which is useful for applications in statistics. In the spirit of some locally stationary processes introduced in the literature, we consider triangular…

Statistics Theory · Mathematics 2016-10-06 Lionel Truquet

In this paper we consider multivariate time series obtained as solution to multidimensional nonlinear stochastic difference equations whose coefficients are allowed to be locally degenerate and to present discontinuities. We provide simple…

Probability · Mathematics 2012-09-07 Marco Ferrante , Giovanni Fonseca

Time series often exhibit non-ergodic behaviour that complicates forecasting and inference. This article proposes a likelihood-based approach for estimating ergodicity transformations that addresses such challenges. The method is broadly…

Econometrics · Economics 2026-01-19 Anthony Britto

We study ergodic properties of some Markov chains models in random environments when the random Markov kernels that define the dynamic satisfy some usual drift and small set conditions but with random coefficients. In particular, we adapt a…

Probability · Mathematics 2021-08-16 Lionel Truquet

In this work, we consider an inhomogeneous (discrete time) Markov chain and are interested in its long time behavior. We provide sufficient conditions to ensure that some of its asymptotic properties can be related to the ones of a…

Probability · Mathematics 2017-11-09 Michel Benaïm , Florian Bouguet , Bertrand Cloez

We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…

Probability · Mathematics 2019-07-29 Balazs Gerencser , Miklos Rasonyi

Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a…

Optimization and Control · Mathematics 2018-09-13 Tao Sun , Yuejiao Sun , Wotao Yin

We generalize stochastic subgradient descent methods to situations in which we do not receive independent samples from the distribution over which we optimize, but instead receive samples that are coupled over time. We show that as long as…

Optimization and Control · Mathematics 2012-08-02 John C. Duchi , Alekh Agarwal , Mikael Johansson , Michael I. Jordan

We study the mixing properties for stochastic accelerated gradient descent (SAGD) on least-squares regression. First, we show that stochastic gradient descent (SGD) and SAGD are simulating the same invariant distribution. Motivated by this,…

Optimization and Control · Mathematics 2019-11-01 Peiyuan Zhang , Hadi Daneshmand , Thomas Hofmann

Motivated by a model presented by S. Gudder, we study a quantum generalization of Markov chains and discuss the relation between these maps and open quantum random walks, a class of quantum channels described by S. Attal et al. We consider…

Quantum Physics · Physics 2016-08-10 Carlos F. Lardizabal , Rafael R. Souza

We study perturbation theory and uniform ergodicity for discrete-time Markov chains on general state spaces in terms of the uniform moments of the first hitting times on some set. The methods we adopt are different from previous ones. For…

Probability · Mathematics 2020-03-17 Yonghua Mao , Yanhong Song

For Markov chains and Markov processes exhibiting a form of stochastic monotonicity (larger states shift up transition probabilities in terms of stochastic dominance), stability and ergodicity results can be obtained using order-theoretic…

Probability · Mathematics 2024-10-01 Takashi Kamihigashi , John Stachurski

We consider a family of measure preserving transformations, which act on a common probability space and are chosen at random by a stationary ergodic Markov chain. This setting defines an instance of a random dynamical system (RDS), which…

Dynamical Systems · Mathematics 2024-02-27 Pablo Lummerzheim , Felix Pogorzelski , Elias Zimmermann

It is known that the Dobrushin's ergodicity coefficient is one of the effective tools to study a behavior of non-homogeneous Markov chains. In the present paper, we define such an ergodicity coefficient of a positive mapping defined on…

Functional Analysis · Mathematics 2013-11-05 Farrukh Mukhamedov

We provide a criterion for establishing lower bounds on the rate of convergence in $f$-variation of a continuous-time ergodic Markov process to its invariant measure. The criterion consists of novel super- and submartingale conditions for…

Probability · Mathematics 2024-04-16 Miha Brešar , Aleksandar Mijatović

Improved rates of convergence for ergodic homogeneous Markov chains are studied. In comparison to the earlier papers the setting is also generalised to the case without a unique dominated measure. Examples are provided where the new bound…

Probability · Mathematics 2021-11-02 Alexander Veretennikov , Maria Veretennikova

In this paper we study the ergodicity and the related semigroup property for a class of symmetric Markov jump processes associated with time changed symmetric $\alpha$-stable processes. For this purpose, explicit and sharp criteria for…

Probability · Mathematics 2013-12-19 Zhen-Qing Chen , Jian Wang

Ergodicity is a fundamental issue for a stochastic process. In this paper, we refine results on ergodicity for a general type of Markov chain to a specific type or the $GI/G/1$-type Markov chain, which has many interesting and important…

Probability · Mathematics 2012-08-28 YongHua Mao , Yongming Tai , Yiqiang Q. Zhao , Jiezhong Zou

Convergence rate analyses of random walk Metropolis-Hastings Markov chains on general state spaces have largely focused on establishing sufficient conditions for geometric ergodicity or on analysis of mixing times. Geometric ergodicity is a…

Statistics Theory · Mathematics 2023-07-24 Riddhiman Bhattacharya , Galin L. Jones

Given a heterogeneous time-series sample, the objective is to find points in time (called change points) where the probability distribution generating the data has changed. The data are assumed to have been generated by arbitrary unknown…

Machine Learning · Statistics 2015-05-13 Azadeh Khaleghi , Daniil Ryabko