Exact Depth-Two and Large-Depth Guarantees for Recursive Rejection Sampling

Proves the optimized uniform/dead binary witness is strictly suboptimal for every fixed draft count at sufficiently large depth. A subtree deletion improves it by an explicitly bounded exponential amount.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24329448
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Exact Depth-Two and Large-Depth Guarantees for Recursive Rejection Sampling

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
preprint

Exact Depth-Two and Large-Depth Guarantees for Recursive Rejection Sampling

preprint en

Abstract

Proves the optimized uniform/dead binary witness is strictly suboptimal for every fixed draft count at sufficiently large depth. A subtree deletion improves it by an explicitly bounded exponential amount.

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon