DocumentCode
355885
Title
Almost sure convergence theorems of rate of coin tosses for random number generation by interval algorithm
Author
Uyematsu, Tomohiko ; Kanaya, Fumio
Author_Institution
Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan
fYear
2000
fDate
2000
Firstpage
457
Abstract
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
Keywords
convergence of numerical methods; probability; random number generation; algorithm efficiency; almost sure convergence theorems; coin tosses rate; inf generating rate; input process; interval algorithm; output process; probability measure; random number generation; sup generating rate; Computer science; Convergence; Electronic mail; Entropy; Extraterrestrial measurements; Hydrogen; Information science; Length measurement; Random number generation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866755
Filename
866755
Link To Document