English
Related papers

Related papers: Hitting times and interlacing eigenvalues: a stoch…

200 papers

Labeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must incorporate past observations. The timing of these observations matters…

Logic in Computer Science · Computer Science 2024-01-30 Thom Badings , Matthias Volk , Sebastian Junges , Marielle Stoelinga , Nils Jansen

More than ever, today we are left with the abundance of molecular data outpaced by the advancements of the phylogenomic methods. Especially in the case of presence of many genes over a set of species under the phylogeny question, more…

Applications · Statistics 2021-11-29 Ali Amiryousefi

Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled…

Probability · Mathematics 2019-01-18 Son L. Nguyen , George Yin , Tuan A. Hoang

Applications of stochastic models often involve the evaluation of steady-state performance, which requires solving a set of balance equations. In most cases of interest, the number of equations is infinite or even uncountable. As a result,…

Optimization and Control · Mathematics 2022-04-08 Shukai Li , Sanjay Mehrotra

In this paper, we demonstrate through the use of matrix calculus a transparent analysis of fractional inhomogeneous Markov models for life insurance where transition matrices commute. The resulting formulae are intuitive matrix…

Probability · Mathematics 2021-10-25 Martin Bladt

We study time-inhomogeneous Markov chains to obtain quantitative results on their asymptotic behavior. We use Poincar\'e, Nash, and logarithmic-Sobolev inequalities. We assume that our Markov chain admits a finite invariant measure at each…

Probability · Mathematics 2024-06-25 Nordine Moumeni

We study a large class of reversible Markov chains with discrete state space and transition matrix $P_N$. We define the notion of a set of {\it metastable points} as a subset of the state space $\G_N$ such that (i) this set is reached from…

Probability · Mathematics 2007-05-23 A. Bovier , M. Eckhoff , V. Gayrard , M. Klein

For many Markov chains of practical interest, the invariant distribution is extremely sensitive to perturbations of some entries of the transition matrix, but insensitive to others; we give an example of such a chain, motivated by a problem…

Numerical Analysis · Mathematics 2015-10-12 Erik Thiede , Brian Van Koten , Jonathan Weare

We consider the discrete time unitary dynamics given by a quantum walk on $\Z^d$ performed by a particle with internal degree of freedom, called coin state, according to the following iterated rule: a unitary update of the coin state takes…

Mathematical Physics · Physics 2015-05-30 Eman Hamza , Alain Joye

This work contributes to the theory of Wiener-Hopf type factorization for finite Markov chains. This theory originated in the seminal paper Barlow et al. (1980), which treated the case of finite time-homogeneous Markov chains. Since then,…

Probability · Mathematics 2019-03-01 Tomasz R. Bielecki , Ziteng Cheng , Igor Cialenco , Ruoting Gong

The paper presents efficient approaches for evaluating convergence rate in total variation for finite and general linear Markov chains. The motivation for studying convergence rate in this metric is its usefulness in various limit theorems.…

Probability · Mathematics 2026-01-21 Alexander Veretennikov

Sequential data naturally arises from user engagement on digital platforms like social media, music streaming services, and web navigation, encapsulating evolving user preferences and behaviors through continuous information streams. A…

Machine Learning · Computer Science 2024-02-28 Fabian Spaeh , Charalampos E. Tsourakakis

Stochastic time-varying optimization is an integral part of learning in which the shape of the function changes over time in a non-deterministic manner. This paper considers multiple models of stochastic time variation and analyzes the…

Optimization and Control · Mathematics 2023-02-23 Ali Yekkehkhany , Han Feng , Donghao Ying , Javad Lavaei

We obtain the posterior distribution of a random process conditioned on observing the empirical frequencies of a finite sample path. We find under a rather broad assumption on the "dependence structure" of the process, {\em c.f.}…

Probability · Mathematics 2022-03-02 Wenqing Hu , Hong Qian

We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…

Optimization and Control · Mathematics 2023-11-01 D. Russell Luke

We develop a martingale approximation approach to studying the limiting behavior of quadratic forms of Markov chains. We use the technique to examine the asymptotic behavior of lag-window estimators in time series and we apply the results…

Probability · Mathematics 2011-08-16 Yves F. Atchade , Matias D. Cattaneo

We study quasi-stationary distributions and quasi-limiting behavior of Markov chains in general reducible state spaces with absorption. We propose a set of assumptions dealing with particular situations where the state space can be…

Probability · Mathematics 2026-01-14 Nicolas Champagnat , Denis Villemonais

These lecture notes introduce the statistical analysis of continuous-time generative models built from Markov dynamics. We begin with the stochastic-calculus foundations of score-based diffusion models, including time reversal, score…

Statistics Theory · Mathematics 2026-04-27 Eddie Aamari , Arthur Stéphanovitch

The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…

Probability · Mathematics 2021-05-21 Aleksandr Shchegolev

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986)…

Probability · Mathematics 2016-02-17 Jeffrey J. Hunter