Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 41 min ago
PreprintarXiv licencearXiv

Common random number simulation as the optimal coordinatewise coupling for iterated random functions

  • Sabrina Sixta
  • Jeffrey S. Rosenthal
Open at sourcePDFDOICite

Abstract

In this paper, we extend the results of Glasserman and Yao (1992) to demonstrate that common random number (CRN) simulation applied to coordinatewise monotone iterated random functions (IRF) represents the optimal allocation of random numbers to minimize the expected distance of an n-step Markov chain (MC) in ℝq. We introduce this concept as the optimal coordinatewise Wasserstein distance (CWD) coupling. We provide specific examples of IRFs where CRN is the optimal CWD coupling, as well as cases where it is not. For IRFs that are not coordinatewise monotone, we illustrate how CRN applied to equimeasurable transformations can result in even lower expected distances compared to CRN applied to the original IRF.

Related

  1. A law of the iterated logarithm for random multiplicative functions on integers with a large prime factor
    Dariusz Buraczewski, Alexander Iksanov
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryProbabilityarXiv
  2. Integer points for iterated Weierstrass elliptic functions
    Jane Hawkins
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryDynamical systemsarXiv
  3. Iterated integrals for generalized Appell functions
    Aradhita Chattopadhyaya, Jan Manschot
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryHigh-energy & particle physicsarXiv
  4. A self-normalized law of the iterated logarithm for Rademacher random multiplicative functions
    Dariusz Buraczewski, Alexander Iksanov
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryProbabilityarXiv
  5. Optimal connectivity of second order iterated line graphs
    Run Zou, Wei Xiong, Mingquan Zhan +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{sixta2026common,
  title = {{Common random number simulation as the optimal coordinatewise coupling for iterated random functions}},
  author = {Sabrina Sixta and Jeffrey S. Rosenthal},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.01787},
  eprint = {2611.01787},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.01787},
}
RIS
TY  - UNPB
TI  - Common random number simulation as the optimal coordinatewise coupling for iterated random functions
AU  - Sabrina Sixta
AU  - Jeffrey S. Rosenthal
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.01787
UR  - https://arxiv.org/abs/2611.01787
AB  - In this paper, we extend the results of Glasserman and Yao (1992) to demonstrate that common random number (CRN) simulation applied to coordinatewise monotone iterated random functions (IRF) represents the optimal allocation of random numbers to minimize the expected distance of an n-step Markov chain (MC) in ℝ^q. We introduce this concept as the optimal coordinatewise Wasserstein distance (CWD) coupling. We provide specific examples of IRFs where CRN is the optimal CWD coupling, as well as cases where it is not. For IRFs that are not coordinatewise monotone, we illustrate how CRN applied to equimeasurable transformations can result in even lower expected distances compared to CRN applied to the original IRF.
ER  -