Approximating distributions and transient probabilities of Markov chains by Bernstein expolynomial functions
نویسندگان
چکیده
In this extended abstract we consider the use of Bernstein polynomials (BPs) for the approximation of distributions and transient probabilities of continuous time Markov chains (CTMCs). We show that while standard BPs are not appropriate to this purpose it is possible to derive from them a family of functions, called in the sequel Bernstein expolynomials (BEs), which enjoys those properties that are necessary for these approximations. For what concerns distribution fitting, BEs correspond to a subset of the family of matrix exponential distributions and hence they are of interest in the field of matrix analytic methods. For what concerns transient probabilities of CTMCs, BEs can provide closed-form approximations which are useful in the analysis of models where the process subordinated to a possibly non-Markovian period is described by a CTMC. The application of BEs for approximating both distributions and transient probabilities will be illustrated through several numerical examples.
منابع مشابه
Evaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملElectrical Networks and Reversible Markov Chains
The object of this part of the course is to show how the mathematics of finite electrical networks can be used in the study of reversible Markov chains on finite and countable state spaces. The basis of the connection is that harmonic functions for reversible Markov chains can be interpreted as voltages for electrical networks. Thus, techniques for calculating, approximating, and bounding volta...
متن کاملOn Entropy and Lyapunov Exponents for Finite-State Channels
The Finite-State Markov Channel (FSMC) is a time-varying channel having states that are characterized by a finite-state Markov chain. These channels have infinite memory, which complicates their capacity analysis. We develop a new method to characterize the capacity of these channels based on Lyapunov exponents. Specifically, we show that the input, output, and conditional entropies for this ch...
متن کاملStiffness-tolerant Methods for Transient Analysis of Stiff Markov Chains
-Three methods for numerical transient analysis of Markov chains, the modified Jensen's method (Jensen's method with steady-state detection of the underlying DTMC and computation of Poisson probabilities using the method of Fox and Glynn [1]), a third-order L-stable implicit Runge-Kutta method, and a second-order L-stable method, TR-BDF2, are compared. These methods are evaluated on the basis o...
متن کاملPerturbation theory for Markov chains via Wasserstein distance
Perturbation theory for Markov chains addresses the question of how small differences in the transition probabilities of Markov chains are reflected in differences between their distributions. We prove powerful and flexible bounds on the distance of the nth step distributions of two Markov chains when one of them satisfies a Wasserstein ergodicity condition. Our work is motivated by the recent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010