Published November 28, 2002
| public
Journal Article
A random stacking process
- Creators
-
Schulman, Leonard J.
Chicago
An error occurred while generating the citation.
Abstract
We examine a generalization of one-dimensional random walks with one reflecting and one absorbing boundary, in which a range of strategies is available, and the goal is to avoid absorption for as long as possible; we show a sharp threshold for the walk parameter separating linear and exponential expected walk times.
Additional Information
© 2002 Elsevier. Received 6 November 2000, Revised 2 May 2001, Accepted 2 May 2001, Available online 20 September 2002. In honor of Daniel J. Kleitman on the occasion of his 65th birthday. Supported in part by NSF CAREER grant 9876172/0049092 and the Charles Lee Powell Foundation. Thanks to the anonymous referees for helpful comments.Additional details
- Eprint ID
- 76446
- DOI
- 10.1016/S0012-365X(02)00512-5
- Resolver ID
- CaltechAUTHORS:20170409-075810379
- NSF
- CISE-9876172
- NSF
- CCF-0049092
- Charles Lee Powell Foundation
- Created
-
2018-04-03Created from EPrint's datestamp field
- Updated
-
2023-09-28Created from EPrint's last_modified field