Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
An Efficient Method for Generating Discrete Random Variables with General Distributions
ACM Transactions on Mathematical Software (TOMS)
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Perfect simulation and non-monotone Markovian systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Perfect sampling of networks with finite and infinite capacity queues
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
| Hi-index | 0.00 |
This paper presents a new method to speed up perfect sampling of Markov chains by skipping passive events during the simulation. We show that this can be done without altering the distribution of the samples. This technique is particularly efficient for the simulation of Markov chains with different time scales such as queueing networks where certain servers are much faster than others. In such cases, the coupling time of the Markov chain can be arbitrarily large while the runtime of the skipping algorithm remains bounded. This is further illustrated by several experiments that also show the role played by the entropy of the system in the performance of our algorithm.