The Maximum Entropy Algorithm Applied to the Two-Dimensional Random Packing Problem

  • G. J. Daniell
Conference paper
Part of the Fundamental Theories of Physics book series (FTPH, volume 70)


The statistical properties of the random close packing, on a plane, of discs of two different sizes are considered. All the possible clusters of a central disc and its nearest neighbours that are allowed by geometry are determined and the proportions of these clusters are computed by the maximum entropy method. The results for the proportions of the three types of contact between the two sizes of disc are compared with a Monte Carlo simulation.


Monte Carlo Simulation Maximum Entropy Packing Problem Central Disc Maximum Entropy Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Dodds, J.A., Simplest statistical geometric model of the simplest version of the multi-component random packing problem. Nature. 256, 187 – 189, 1975.CrossRefGoogle Scholar
  2. [2]
    Bideau, D., Gervois, A., Oger, L., Troadec, J.P., Geometrical Properties of Disordered Packings of Hard Discs. J. Physique 47, 1697 – 1707, 1986.CrossRefGoogle Scholar
  3. [3]
    Jaynes,E.T., Prior Probabilities. IEEE Transactions on Systems Science and Cybernetics. SSC-4, 227–240, 1968.CrossRefGoogle Scholar
  4. [4]
    Rivier,N. and Lissowski,A., On the correlation between sizes and shapes of cells in epithelial mosaics. J.Phys.A: Math.Gen. 15, L143 – L148, 1982.MathSciNetCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • G. J. Daniell
    • 1
  1. 1.Physics DepartmentUniversity of SouthamptonSouthamptonUK

Personalised recommendations