## Abstract

The paper studies the minimum randomness necessary for finite precision simulation of a random source. In random process simulation, the objective of the simulator is to approximate a set of desired statistics. To this end, the simulator has access to a source of pure random bits-a random number generator-and the approximation is achieved by properly mapping the output of the random number generator to the alphabet of the approximated process. An important question that arises is what is the number of pure random bits per source output that the most efficient simulation scheme needs in order to produce every sample path of the approximating process. The answer to this question depends on the statistics of the approximated source and on the sense of approximation. If the objective was to produce-with the aid of only pure random bits-exactly the same statistics (distributions) as that of the desired process, then one could only simulate finite alphabet random processes whose statistics admit finite binary representations. For example, an exact simulation of a binary process with irrational probabilities is not feasible, since the number of fair bits per source output required for accurate simulation is infinite.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994 |

Number of pages | 1 |

DOIs | |

State | Published - Dec 1 1994 |

Event | 1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: Jun 27 1994 → Jul 1 1994 |

### Other

Other | 1994 IEEE International Symposium on Information Theory, ISIT 1994 |
---|---|

Country | Norway |

City | Trondheim |

Period | 6/27/94 → 7/1/94 |

## All Science Journal Classification (ASJC) codes

- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems