Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T14:02:59.140Z Has data issue: false hasContentIssue false
  • English
  • Français

Nested Monte Carlo study of random packing on the sphere

Published online by Cambridge University Press:  14 July 2016

R. P. C. Rodgers  and
A. J. Baddeley
R. P. C. Rodgers*
Affiliation:
University of California, San Francisco
A. J. Baddeley*
Affiliation:
Centre for Mathematics and Computer Science, Amsterdam
*
∗ Postal address: Depts of Pharmaceutical Chemistry and Laboratory Medicine, University of California, San Francisco, CA 94143, USA.
∗∗ Postal address: Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, Netherlands.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider two random sequential packing processes in which spheres of unit radius are randomly attached to the surface of a fixed unit sphere. Independent random spheres are generated and added successively, provided there is no overlap with previous spheres. In model 1, the process stops when a trial sphere intersects one of the previously-accepted spheres. In model 2, random sequential packing, any such overlapping trial sphere is discarded and the next random sphere is tried, until it is impossible to add any further spheres.

Previous workers have conjectured convincingly that no exact analytical solution is possible for this type of problem. We use Monte Carlo simulation methods to estimate transition probabilities for the two models. Because some probabilities are extremely small, a simulation using independent repetitions of the model would be inefficient. We designed a branching process of conditionally binomial trials, and performed over 108 trials on a supercomputer.

Keywords

BRANCHING PROCESSBRANCHING SIMULATIONCAR PARKING PROBLEMCRAY XMPMONTE CARLORANDOM AGGREGATIONRANDOM NUMBER GENERATORSRANDOM POINTS ON A SPHERESPHERE PACKINGSUPERCOMPUTINGTESTS OF UNIFORM DISTRIBUTION
Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 3 , September 1991 , pp. 539 - 552
Copyright
Copyright © Applied Probability Trust 1991 

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] Akeda, Y. and Hori, M. (1976) On random sequential packing in two and three dimensions. Biometrika 63, 361–366.Google Scholar
[2] Blaisdell, B. E. and Solomon, H. (1970) On random sequential packing in the plane and a conjecture of Palasti. J. Appl. Prob. 7, 667–698.CrossRefGoogle Scholar
[3] Blaisdell, B. E. and Solomon, H. (1982) Random sequential packing in Euclidean spaces of dimensions three and four and a conjecture of Palasti. J. Appl. Prob. 19, 382–390.Google Scholar
[4] Cowan, R. (1984) A model for random packing of disks in the neighbourhood of one disk. SIAM J. Appl. Math. 44, 839–853.Google Scholar
[5] Feder, J. (1980) Random sequential adsorption. J. Theor. Biol. 87, 237–254.Google Scholar
[6] Finegold, L. and Donnell, J. T. (1979) Maximum density of random placing of membrane particles. Nature 278, 443–445.Google Scholar
[7] Gotoh, K. and Finney, J. L. (1974) Statistical geometrical approach to random packing density of equal spheres. Nature 252, 202–205.Google Scholar
[8] Jodrey, W. S. and Tory, E. M. (1980) Random sequential packing in Rn. J. Statist. Comp. Simul. 10, 87–93.Google Scholar
[9] Knuth, D. (1969) The Art of Computer Programming. Vol 2. Seminumerical Algorithms. Addison-Wesley, Reading, Mass. Google Scholar
[10] Marsaglia, G. (1972) Choosing a point from the surface of a sphere. Ann. Math. Statist. 43, 645–646.CrossRefGoogle Scholar
[11] Mcleod, A. I. (1985) A remark on Algorithm AS 183. Appl. Statist. 34, 198–200.Google Scholar
[12] Miles, R. E. (1971) Random points, sets, and tessellations on the surface of a sphere. Sankhya A 33, 145–174.Google Scholar
[13] Renyi, A. (1958) On a one-dimensional problem concerning place filling (in Hungarian). Magyar Tud. Akad. Mat. Intézet Közl. (Publ. Math. Inst. Hungar. Acad. Sci.) 3, 109–127.Google Scholar
[14] Ripley, B. D. (1987) Statistical Simulation. Wiley, New York.Google Scholar
[15] Stephens, M. A. (1964) The testing of unit vectors for randomness. J. Amer. Statist. Assoc. 59, 160–167.CrossRefGoogle Scholar
[16] Tory, E.M., Jodrey, W. S. and Pickard, D. K. (1983) Simulation of random sequential adsorption: efficient methods and resolution of conflicting results. J. Theor. Biol. 102, 439–445.CrossRefGoogle Scholar
[17] Wichmann, B. A. and Hill, I.D. (1982) Algorithm AS 183: An efficient an portable pseudorandom number generator. Appl. Statist. 31, 188–190.Google Scholar
[18] Wichmann, B. A. and Hill, I. D. (1984) Correction to Algorithm AS 183. Appl. Statist. 33, 123.Google Scholar
[19] Wodak, S. J. and Janin, J. (1980) Analytical approximations to the accessible surface area of proteins. Proc. Nat. Acad. Sci. USA 77, 1736–1740.Google Scholar