Difference between revisions of "Random Number Selection in Self-Assembly"
m |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
|title=Random Number Selection in Self-Assembly | |title=Random Number Selection in Self-Assembly | ||
|date=2009/09/07 | |date=2009/09/07 | ||
| − | |abstract=<p>We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range | + | |abstract=<p>We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range $\{0, ... , n - 1\}$, we exhibit methods for randomly selecting a number within that range. We present three constructions exhibiting a trade-off between space requirements and closeness to uniformity.</p> |
| − | <p>The first selector selects a random number with probability | + | <p>The first selector selects a random number with probability $\Theta(1/n)$ using |
| − | + | $\O(log^2 n)$ tiles. The second selector takes a user-specified parameter that guarantees the probabilities are arbitrarily close to uniform, at the cost of additional space. The third selector selects a random number with probability exactly $1/n$, and uses no more space than the first selector with high probability, but uses potentially unbounded space.</p> | |
|authors=David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, and Damien Woods | |authors=David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, and Damien Woods | ||
|file=[http://www.self-assembly.net/mpatitz/papers/RNSSA.pdf Random Number Selection in Self-Assembly.pdf] | |file=[http://www.self-assembly.net/mpatitz/papers/RNSSA.pdf Random Number Selection in Self-Assembly.pdf] | ||
}} | }} | ||
Latest revision as of 12:43, 22 June 2021
Published on: 2009/09/07
Abstract
We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range \(\{0, ... , n - 1\}\), we exhibit methods for randomly selecting a number within that range. We present three constructions exhibiting a trade-off between space requirements and closeness to uniformity.
The first selector selects a random number with probability \(\Theta(1/n)\) using \(\O(log^2 n)\) tiles. The second selector takes a user-specified parameter that guarantees the probabilities are arbitrarily close to uniform, at the cost of additional space. The third selector selects a random number with probability exactly \(1/n\), and uses no more space than the first selector with high probability, but uses potentially unbounded space.
Authors
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, and Damien Woods
