Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-18T08:57:36.539Z Has data issue: false hasContentIssue false
  • English
  • Français

The Maximum of a Random Walk and Its Application to Rectangle Packing

Published online by Cambridge University Press:  27 July 2009

E. G. Coffman Jr ,
Philippe Flajolet ,
Leopold Flatto  and
Micha Hofri
E. G. Coffman Jr
Affiliation:
Bell Labs, Lucent Technologies, 700 Mountain Avenue, Murray Hill, New Jersey 07974
Philippe Flajolet
Affiliation:
INRIA-Rocquencourt F-78153 La Chesney, France
Leopold Flatto
Affiliation:
Bell Labs, Lucent Technologies, 700 Mountain Avenue, Murray Hill, New Jersey 07974
Micha Hofri
Affiliation:
Department of Computer Science, Rice University, Houston, Texas 77005
Get access Rights & Permissions [Opens in a new window]

Abstract

Let S0,…,Sn be a symmetric random walk that starts at the origin (S0 = 0) and takes steps uniformly distributed on [— 1,+1]. We study the large-n behavior of the expected maximum excursion and prove the estimate

,

where c = 0.297952.... This estimate applies to the problem of packing n rectangles into a unit-width strip; in particular, it makes much more precise the known upper bound on the expected minimum height, O(n½), when the rectangle sides are 2n independent uniform random draws from [0,1].

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 12 , Issue 3 , July 1998 , pp. 373 - 386
Copyright
Copyright © Cambridge University Press 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Abramowitz, M. & Stegun, I.A. (1972). Handbook of mathematical functions. New York: Dover Publications.Google Scholar
2.Coffman, E.G. Jr & Lagarias, J.C. (1989). A probabilistic analysis of square packing. SIAM Journal of Computing 18: 166–185.CrossRefGoogle Scholar
3.Coffman, E.G. Jr & Shor, P.W. (1993). Packing in two dimensions: Asymptotic average-case analysis of algorithms. Algorithmica 9(3): 253–277.CrossRefGoogle Scholar
4.Feller, W. (1971). An introduction to probability theory and its applications. Vol. II, 2nd ed.New York: John Wiley & Sons.Google Scholar
5.Henrici, P. (1977). Applied and computational complex analysis. Vol. II. New York: John Wiley & Sons.Google Scholar
6.Hofri, M. (1995). Analysis of algorithms: Computational methods & mathematical tools. New York: Oxford University Press.Google Scholar
7.Olver, F. W.J. (1974). Asymptotics and special functions. New York: Academic Press.Google Scholar