Quickly Avoiding a Random Catastrophe
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915184388341760 |
|---|---|
| author | Ashur, Stav Har-Peled, Sariel |
| author_facet | Ashur, Stav Har-Peled, Sariel |
| contents | We study the problem of constructing simulations of a given randomized search algorithm \texttt{alg} with expected running time $O( \mathcal{O} \log \mathcal{O})$, where $\mathcal{O}$ is the optimal expected running time of any such simulation. Counterintuitively, these simulators can be dramatically faster than the original algorithm in getting alg to perform a single successful run, and this is done without any knowledge about alg, its running time distribution, etc.
For example, consider an algorithm that randomly picks some integer $t$ according to some distribution over the integers, and runs for $t$ seconds. then with probability $1/2$ it stops, or else runs forever (i.e., a catastrophe). The simulators described here, for this case, all terminate in constant expected time, with exponentially decaying distribution on the running time of the simulation.
Luby et al. studied this problem before -- and our main contribution is in offering several additional simulation strategies to the one they describe. In particular, one of our (optimal) simulation strategies is strikingly simple: Randomly pick an integer $t>0$ with probability $c/t^2$ (with $c= 6/π^2$). Run the algorithm for $t$ seconds. If the run of alg terminates before this threshold is met, the simulation succeeded and it exits. Otherwise, the simulator repeat the process till success. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_04633 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quickly Avoiding a Random Catastrophe Ashur, Stav Har-Peled, Sariel Data Structures and Algorithms We study the problem of constructing simulations of a given randomized search algorithm \texttt{alg} with expected running time $O( \mathcal{O} \log \mathcal{O})$, where $\mathcal{O}$ is the optimal expected running time of any such simulation. Counterintuitively, these simulators can be dramatically faster than the original algorithm in getting alg to perform a single successful run, and this is done without any knowledge about alg, its running time distribution, etc. For example, consider an algorithm that randomly picks some integer $t$ according to some distribution over the integers, and runs for $t$ seconds. then with probability $1/2$ it stops, or else runs forever (i.e., a catastrophe). The simulators described here, for this case, all terminate in constant expected time, with exponentially decaying distribution on the running time of the simulation. Luby et al. studied this problem before -- and our main contribution is in offering several additional simulation strategies to the one they describe. In particular, one of our (optimal) simulation strategies is strikingly simple: Randomly pick an integer $t>0$ with probability $c/t^2$ (with $c= 6/π^2$). Run the algorithm for $t$ seconds. If the run of alg terminates before this threshold is met, the simulation succeeded and it exits. Otherwise, the simulator repeat the process till success. |
| title | Quickly Avoiding a Random Catastrophe |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2503.04633 |