Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic Analyses
نویسندگان
چکیده
منابع مشابه
Non-Asymptotic and Asymptotic Analyses of Information Processing on Markov Chains
We study finite-length bounds for source coding with side information for Markov sources and channel coding for channels with conditional Markovian additive noise. For this purpose, we propose two criteria for finite-length bounds. One is the asymptotic optimality and the other is the efficient computability of the bound. Then, we derive finite-length upper and lower bounds for coding length in...
متن کاملAsymptotic Ltering for Nite State Markov Chains
Asymptotic formulae for the optimal ltering error for nite state space Markov chains observed in independent noise are presented. Asymptotically optimal simple lters, which do not depend on the transition rates of the chain, are also presented.
متن کاملUniform Random Rational Number Generation
Classical floating point random numbers fail simple tests when considered as rational numbers. A uniform random number generator based on a linear congruential generator with output in the rational numbers is implemented within the two computer algebra systems Maple 10 and MuPAD Pro 3.1. The empirical tests in Knuth’s suite of tests show no evidence against the hypothesis that the output sample...
متن کاملCLTs and asymptotic variance of time-sampled Markov chains
Abstract: For a Markov transition kernel P and a probability distribution μ on nonnegative integers, a time-sampled Markov chain evolves according to the transition kernel Pμ = ∑ k μ(k)P k. In this note we obtain CLT conditions for time-sampled Markov chains and derive a spectral formula for the asymptotic variance. Using these results we compare efficiency of Barker’s and Metropolis algorithms...
متن کاملAsymptotic Variance of Passage Time Estimators in Markov Chains
We consider the problem of estimating passage times in stochastic simulations of Markov chains+ Two types of estimator are considered for this purpose: the “simple” and the “overlapping” estimator; they are compared in terms of their asymptotic variance+ The analysis is based on the regenerative structure of the process and it is shown that when estimating the mean passage time, the simple esti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2530084