Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-24T18:25:54.341Z Has data issue: false hasContentIssue false

Phases in the Diffusion of Gases via the Ehrenfest URN Modelx

Published online by Cambridge University Press:  14 July 2016

Srinivasan Balaji*
Affiliation:
The George Washington University
Hosam Mahmoud*
Affiliation:
The George Washington University
Zhang Tong*
Affiliation:
The George Washington University
*
Postal address: Department of Statistics, The George Washington University, Washington, DC 20052, USA.
Postal address: Department of Statistics, The George Washington University, Washington, DC 20052, USA.
Postal address: Department of Statistics, The George Washington University, Washington, DC 20052, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The Ehrenfest urn is a model for the diffusion of gases between two chambers. Classic research deals with this system as a Markovian model with a fixed number of balls, and derives the steady-state behavior as a binomial distribution (which can be approximated by a normal distribution). We study the gradual change for an urn containing n (a very large number) balls from the initial condition to the steady state. We look at the status of the urn after kn draws. We identify three phases of kn: the growing sublinear, the linear, and the superlinear. In the growing sublinear phase the amount of gas in each chamber is normally distributed, with parameters that are influenced by the initial conditions. In the linear phase a different normal distribution applies, in which the influence of the initial conditions is attenuated. The steady state is not a good approximation until a certain superlinear amount of time has elapsed. At the superlinear stage the mix is nearly perfect, with a nearly perfect symmetrical normal distribution in which the effect of the initial conditions is completely washed away. We give interpretations for how the results in different phases conjoin at the ‘seam lines’. In fact, these Gaussian phases are all manifestations of one master theorem. The results are obtained via martingale theory.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010 

References

Antognini, A. B. (2005). On the speed of convergence of some urn designs for the balanced allocation of two treatments. Metrika 62, 309322.Google Scholar
Bellman, R. and Harris, T. (1951). Recurrence times for the Ehrenfest model. Pacific J. Math. 1, 179193.Google Scholar
Blom, G. (1989). Mean transition times for the Ehrenfest urn model. Adv. Appl. Prob. 21, 479480.CrossRefGoogle Scholar
Diaconis, P. (1996). The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. USA 93, 16591664.Google Scholar
Ehrenfest, P. and Ehrenfest, T. (1907). Über zwei bekannte einwände gegen das Boltzmannsche H-theorem. Phys. Z. 8, 311314.Google Scholar
Hall, P. and Heyde, C. C. (1980). Martingale Limit Theory and Its Applications. Academic Press, New York.Google Scholar
Karlin, S. and McGregor, J. (1965). Ehrenfest urn models. J. Appl. Prob. 2, 352376.Google Scholar
Karr, A. F. (1993). Probability. Springer, New York.Google Scholar
Kolchin, V. F., Sevastyanov, B. A. and Chistyakov, V. P. (1976). Random Allocations. Moscow.Google Scholar
Mahmoud, H. M. (2008). Pólya Urn Models. CRC Press, Boca Raton, FL.Google Scholar
Mahmoud, H. (2010). Gaussian phases in generalized coupon collection. Unpublished manuscript.Google Scholar
Mikhailov, V. G. (1977). A Poisson limit theorem in the scheme of group disposal of particles. Theory Prob. Appl. 22, 152156.Google Scholar
Mikhailov, V. G. (1980). Asymptotic normality of the number of empty cells in allocation of particles by groups. Theory Prob. Appl. 25, 8290.CrossRefGoogle Scholar
Smythe, R. (2009). Phases in generalized coupon collection. Personal communication.Google Scholar
Vatutin, V. A. and Mikhailov, V. G. (1982). Limit theorems for the number of empty cells in an equiprobable scheme for the distribution of particles by groups. Theory Prob. Appl. 27, 734743.Google Scholar