Almost sure convergence theorems of rate of coin tosses for random number generation by interval algorithm

DOI

Description

This paper deals with the interval algorithm proposed by Hen and Hoshi for random number generation, and evaluates the efficiency of the algorithm for each sample path instead of evaluating overall expectation. We show a theorem in the almost-sure sense to give bounds on the sup generating rate as well as on the inf generating rate for each sample of input and output processes.

Journal

Details 詳細情報について

Report a problem

Back to top