{
  "abstract": "We study noninteractive simulation from a finite correlated source. Alice and Bob observe independent copies of the source and generate outputs without communication. We give a quantitative construction for arbitrary finite output alphabets: for every fixed source, a joint law that is simulable with arbitrarily many samples can be approximated using a number of samples polynomial jointly in the output alphabet sizes and the inverse accuracy. We first study binary outputs. A one-sided Wright--Fisher comparison gives a source-dependent explicit exponent and a finite-head Gaussian-threshold representation. We then handle arbitrary finite output alphabets through averaged influence regularity, simplex-preserving Gaussian moment lifting, and a common Gaussian projection for all correlated-prefix states. The sample exponent is independent of the output alphabet sizes. For a concrete biased binary source we certify an explicit exponent below $19$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2611.11974",
  "author_total": 1,
  "authors": [
    {
      "name": "Haoran Wang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/e3q5qx6ahw0jf.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2611.11974",
  "fulltext_url": null,
  "id": "e3q5qx6ahw0jf",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2611.11974",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CC"
    ],
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2611.11974",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-09",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/e3q5qx6ahw0jf.ris",
  "sources": [
    {
      "first_seen": "2026-11-10T06:21:34Z",
      "native_id": "2611.11974",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2611.11974"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Polynomial Sample Complexity of Noninteractive Simulation over Finite Alphabets",
  "title_text": "Polynomial Sample Complexity of Noninteractive Simulation over Finite Alphabets",
  "type": "preprint",
  "updated_at": "2026-11-10T06:21:34Z",
  "url": "https://research.draconitic.com/paper/e3q5qx6ahw0jf",
  "venue": "arXiv",
  "versions": []
}