English
Related papers

Related papers: Quantitative bounds on convergence of time-inhomog…

200 papers

Density-dependent Markov chains form an important class of continuous-time Markov chains in population dynamics. On any fixed time window [0, T ], when the scale parameter K > 0 is large such chains are well approximated by the solution of…

Probability · Mathematics 2020-12-14 Adrien Prodhomme

Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…

Probability · Mathematics 2015-09-03 Mathav Murugan , Laurent Saloff-Coste

Over the last three decades, there has been a considerable effort within the applied probability community to develop techniques for bounding the convergence rates of general state space Markov chains. Most of these results assume the…

Probability · Mathematics 2020-09-29 Qian Qin , James P. Hobert

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…

Probability · Mathematics 2025-09-30 George Andriopoulos

We study branching Markov chains on a countable state space (space of types) $\mathscr{X}$, with the focus on the qualitative aspects of the limit behaviour of the evolving empirical population distributions. No conditions are imposed on…

Probability · Mathematics 2025-07-30 Vadim A. Kaimanovich , Wolfgang Woess

Given a sequence of resistance forms that converges with respect to the Gromov-Hausdorff-vague topology and satisfies a uniform volume doubling condition, we show the convergence of corresponding Brownian motions and local times. As a…

Probability · Mathematics 2016-09-08 D. A. Croydon , B. M. Hambly , T. Kumagai

We consider two examples for a well-known method for obtaining concentration of measure (COM) bounds for a given observable in a given measure. The method is to consider an auxiliary Markov chain for which the invariant distribution is the…

Probability · Mathematics 2019-01-25 Michael Froehlich , Shannon Starr

We consider the convergence of a continuous-time Markov chain approximation X^h, h>0, to an R^d-valued Levy process X. The state space of X^h is an equidistant lattice and its Q-matrix is chosen to approximate the generator of X. In…

Probability · Mathematics 2014-07-02 Aleksandar Mijatović , Matija Vidmar , Saul Jacka

In this paper we establish a diffusion limit for a multivariate continuous time Markov chain whose components are indexed by vertices of a finite graph. The components take values in a common finite set of non-negative integers and evolve…

Probability · Mathematics 2025-09-15 Anatolii Puhalskii , Vadim Shcherbakov

This paper will provide several classes of strictly stationary, countable-state, irreducible, aperiodic Markov chains that are reversible and have finite second moments, such that the central limit theorem fails to hold. The main purpose is…

Probability · Mathematics 2026-03-11 Richard C. Bradley

We study mean-field particle approximations of normalized Feynman-Kac semi-groups, usually called Fleming-Viot or Feynman-Kac particle systems. Assuming various large time stability properties of the semi-group uniformly in the initial…

Probability · Mathematics 2024-12-23 Lucas Journel , Mathias Rousset

We establish quantitative homogenization results for time-dependent random conductance models with stable-like long range jumps on $\Z^d$, where the transition probability from $x$ to $y$ is given by $w_{t, x,y}|x-y|^{-d-\alpha}$ with…

Probability · Mathematics 2025-12-01 Xin Chen , Zhen-Qing Chen , Takashi Kumagai , Jian Wang

We provide non-asymptotic bounds for the well-known temporal difference learning algorithm TD(0) with linear function approximators. These include high-probability bounds as well as bounds in expectation. Our analysis suggests that a…

Machine Learning · Computer Science 2015-09-02 Nathaniel Korda , L. A. Prashanth

Martingale concentration inequalities constitute a powerful mathematical tool in the analysis of problems in a wide variety of fields ranging from probability and statistics to information theory and machine learning. Here we apply…

Quantum Physics · Physics 2017-03-07 Cambyse Rouze , Nilanjana Datta

Markov chain models are used in various fields, such behavioral sciences or econometrics. Although the goodness of fit of the model is usually assessed by large sample approximation, it is desirable to use conditional tests if the sample…

Statistics Theory · Mathematics 2012-01-11 Akimichi Takemura , Hisayuki Hara

The weak and strong laws of large numbers for time-inhomogeneous Markov chains are studied under general conditions. First, under Drift Condition and Contraction Condition in total variation, we prove the weak law of large numbers. Then,…

Probability · Mathematics 2026-03-19 Aaron Lau , Kouji Yano

We establish that if a sequence of electrical networks equipped with conductance measures converges in the local Gromov--Hausdorff-vague topology and satisfies certain non-explosion and metric-entropy conditions,then the sequence of…

Probability · Mathematics 2025-11-21 Ryoichiro Noda

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

Using two simple examples, the continuous-time random walk as well as a two state Markov chain, the relation between generalized anomalous relaxation equations and semi-Markov processes is illustrated. This relation is then used to discuss…

Probability · Mathematics 2017-11-22 Enrico Scalas

Adaptive Markov chains are an important class of Monte Carlo methods for sampling from probability distributions. The time evolution of adaptive algorithms depends on past samples, and thus these algorithms are non-Markovian. Although there…

Probability · Mathematics 2014-10-02 Natesh S. Pillai , Aaron Smith