相关论文: Order estimation of Markov chains

Markov decision processes continue to gain in popularity for modeling a wide range of applications ranging from analysis of supply chains and queuing networks to cognitive science and control of autonomous vehicles. Nonetheless, they tend…

We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters. Our algorithm is based on two key…

We establish a sharp upper estimate for the order of a canonical system in terms of the Hamiltonian. This upper estimate becomes an equality in the case of Krein strings. As an application we prove a conjecture of Valent about the order of…

Suppose we observe an invertible linear process with independent mean-zero innovations and with coefficients depending on a finite-dimensional parameter, and we want to estimate the expectation of some function under the stationary…

To draw inference on serial extremal dependence within heavy-tailed Markov chains, Drees, Segers and Warcho{\l} [Extremes (2015) 18, 369--402] proposed nonparametric estimators of the spectral tail process. The methodology can be extended…

An important problem in the implementation of Markov Chain Monte Carlo algorithms is to determine the convergence time, or the number of iterations before the chain is close to stationarity. For many Markov chains used in practice this time…

Markov chains are an important tool for modelling and evaluating systems in computer science, economics, biology and numerous other fields. Thus, approximating Markov chains is a useful tool for decreasing the computational effort needed…

We study convergence almost everywhere of sequences of Schr\"odinger means. We also replace sequences by uncountable sets.

We prove a law of large numbers for empirical approximations of the spectrum of a kernel integral operator by the spectrum of random matrices based on a sample drawn from a Markov chain, which complements the results by V. Koltchinskii and…

We present a new trace estimator of the matrix whose explicit form is not given but its matrix multiplication to a vector is available. The form of the estimator is similar to the Hutchison stochastic trace estimator, but instead of the…

We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by…

In this paper, we consider continuous-time Markov chains with a finite state space under nonlinear expectations. We define so-called Q-operators as an extension of Q-matrices or rate matrices to a nonlinear setup, where the nonlinearity is…

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…

Let S be a denumerable state space and let P be a transition probability matrix on S. If a denumerable set M of nonnegative matrices is such that the sum of the matrices is equal to P, then we call M a partition of P. Let K denote the set…

Let $X_1, \ldots, X_n$ be independent non-negative random variables with cumulative distribution functions $F_1,F_2,\ldots,F_n$, each satisfying certain (rather mild) conditions. We show that the median of $k$-th smallest order statistic of…

Let $(X_n)_{n \in\mathbb{N}}$ be a $V$-geometrically ergodic Markov chain on a measurable space $\mathbb{X}$ with invariant probability distribution $\pi$. In this paper, we propose a discretization scheme providing a computable sequence…

In this paper, we consider a type of time-changed Markov process, where the time-change is an inverse killed subordinator. This can be seen as an extension of Chen (Chen, Z., Time fractional equations and probabilistic representation, Chaos…

We consider a Markov process in continuous time with a finite number of discrete states. The time-dependent probabilities of being in any state of the Markov chain are governed by a set of ordinary differential equations, whose dimension…

We consider Markov chains on general state spaces in stationary random environment which are defined by a random mapping that is contractive up to a bounded perturbation. We prove their convergence to a limiting law, providing convergence…