Common random numbers
ID: common-random-numbers
Common random numbers couples simulations of different systems by reusing the same random inputs when estimating a difference. The individual output probability distributions must stay correct; the useful change is their dependence. If paired outputs are with finite variances, thenPositive covariance therefore reduces the variance of their difference compared with independent outputs having those same marginal laws. This identity explains the technique, but does not guarantee a beneficial covariance for every simulation.[ref]
Some Guidelines and Guarantees for Common Random Numbers by Paul Glasserman and David D. Yao. p.884, Introduction: variance identity and dependence mechanism
For an original example, let have the uniform distribution on , and compare with . Their difference has expected value and variance . With independent uniforms , the same marginal outputs and instead giveAveraging independent pairs divides either variance by . In this stipulated example, sharing the input reduces variance fivefold for the same number of pairs.
The sign matters. If outputs are and , sharing gives difference with variance . Using independent inputs gives variance , so this coupling is worse. Reusing an input is useful when it produces an appropriate response in both systems, not simply because the same seed appears in two runs. In a simulation with branching or different event counts, matching random inputs to corresponding events is part of specifying the coupling.[ref]
Some Guidelines and Guarantees for Common Random Numbers by Paul Glasserman and David D. Yao. pp.884–885, common random numbers and synchronization; abstract, monotonicity conditions
New to topics? Read the docs here!