Sangam: A Confluence of Knowledge Streams

A race toward the origin between n random walks

Show simple item record

dc.contributor Statistics
dc.contributor Conolly, Brian W.
dc.contributor Harshbarger, Boyd
dc.contributor Myers, Raymond H.
dc.contributor Kramer, Clyde Y.
dc.contributor Jensen, Donald R.
dc.contributor Fabrycky, Wolter J.
dc.creator Denby, Daniel Caleb
dc.date 2014-03-14T21:11:42Z
dc.date 2014-03-14T21:11:42Z
dc.date 1968-05-05
dc.date 2010-06-02
dc.date 2010-06-02
dc.date 2010-06-02
dc.date.accessioned 2023-02-28T18:21:21Z
dc.date.available 2023-02-28T18:21:21Z
dc.identifier etd-06022010-020319
dc.identifier http://hdl.handle.net/10919/37928
dc.identifier http://scholar.lib.vt.edu/theses/available/etd-06022010-020319/
dc.identifier.uri http://localhost:8080/xmlui/handle/CUHPOERS/269700
dc.description This dissertation studies systems of "competing" discrete random walks as discrete and continuous time processes. A system is thought of as containing n imaginary particles performing random walks on lines parallel to the x-axis in Cartesian space. The particles act completely independently of each other and have, in general, different starting coordinates. In the discrete time situation, the motion of the n particles is governed by n independent streams of Bernoulli trials with success probabilities p₁, p₂,…, and p<sub>n</sub> respectively. A success for any particle at a trial causes that particle to move one unit toward the origin, and a failure causes it to take a "zero-step" (i.e. remain stationary). A probabilistic description is first given of the positions of the particles at arbitrary points in time, and this is extended to provide time dependent and independent probabilities of which particle is the winner, that is to say, of which particle first reaches the origin. In this case "draws" are possible and the relevant probabilities are derived. The results are expressed, in particular, in terms of Generalized Hypergeometric Functions. In addition, formulae are given for the duration of what may now be regarded as a race with winning post at the origin. In the continuous time situation, the motion of the n particles is governed by n independent Poisson streams, in general, having different parameters. A treatment similar to that for the discrete time situation is given with the exception of draw probabilities which in this case are not possible. Approximations are obtained in many cases. Apart from their practical utility, these give insight into the operation of the systems in that they reveal how changes in one or more of the parameters may affect the win and draw probabilities and also the duration of the race. A chapter is devoted to practical applications. Here it is shown how the theory of random walks racing toward the origin can be utilized as a basic framework for explaining the operation of, and answering pertinent questions concerning several apparently diverse situations. Examples are Lanchester Combat theory, inventory control, reliability and queueing theory.
dc.description Ph. D.
dc.format 158 leaves
dc.format BTD
dc.format application/pdf
dc.format application/pdf
dc.language en
dc.publisher Virginia Tech
dc.relation OCLC# 20737116
dc.relation LD5655.V856_1968.D4.pdf
dc.rights In Copyright
dc.rights http://rightsstatements.org/vocab/InC/1.0/
dc.subject LD5655.V856 1968.D4
dc.subject Random walks (Mathematics)
dc.title A race toward the origin between n random walks
dc.type Dissertation
dc.type Text


Files in this item

Files Size Format View
LD5655.V856_1968.D4.pdf 5.304Mb application/pdf View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse