Random sequential adsorption

Last updated

Random sequential adsorption (RSA) refers to a process where particles are randomly introduced in a system, and if they do not overlap any previously adsorbed particle, they adsorb and remain fixed for the rest of the process. RSA can be carried out in computer simulation, in a mathematical analysis, or in experiments. It was first studied by one-dimensional models: the attachment of pendant groups in a polymer chain by Paul Flory, and the car-parking problem by Alfréd Rényi. [1] Other early works include those of Benjamin Widom. [2] In two and higher dimensions many systems have been studied by computer simulation, including in 2d, disks, randomly oriented squares and rectangles, aligned squares and rectangles, various other shapes, etc.

Contents

An important result is the maximum surface coverage, called the saturation coverage or the packing fraction. On this page we list that coverage for many systems.

Saturation in the random sequential adsorption (RSA) of circular disks. Random Sequential Adsorption Disks1.png
Saturation in the random sequential adsorption (RSA) of circular disks.

The blocking process has been studied in detail in terms of the random sequential adsorption (RSA) model. [3] The simplest RSA model related to deposition of spherical particles considers irreversible adsorption of circular disks. One disk after another is placed randomly at a surface. Once a disk is placed, it sticks at the same spot, and cannot be removed. When an attempt to deposit a disk would result in an overlap with an already deposited disk, this attempt is rejected. Within this model, the surface is initially filled rapidly, but the more one approaches saturation the slower the surface is being filled. Within the RSA model, saturation is sometimes referred to as jamming. For circular disks, saturation occurs at a coverage of 0.547. When the depositing particles are polydisperse, much higher surface coverage can be reached, since the small particles will be able to deposit into the holes in between the larger deposited particles. On the other hand, rod like particles may lead to much smaller coverage, since a few misaligned rods may block a large portion of the surface.

For the one-dimensional parking-car problem, Renyi [1] has shown that the maximum coverage is equal to

the so-called Renyi car-parking constant. [4]

Then followed the conjecture of Ilona Palásti, [5] who proposed that the coverage of d-dimensional aligned squares, cubes and hypercubes is equal to θ1d. This conjecture led to a great deal of work arguing in favor of it, against it, and finally computer simulations in two and three dimensions showing that it was a good approximation but not exact. The accuracy of this conjecture in higher dimensions is not known.

For -mers on a one-dimensional lattice, we have for the fraction of vertices covered, [6]

When goes to infinity, this gives the Renyi result above. For k = 2, this gives the Flory [7] result .

For percolation thresholds related to random sequentially adsorbed particles, see Percolation threshold.

RSA of needles (infinitely thin line segments). This shows a dense stage although here saturation never occurs. Random sequential adsorption of line segments.png
RSA of needles (infinitely thin line segments). This shows a dense stage although here saturation never occurs.

Saturation coverage of k-mers on 1d lattice systems

systemSaturated coverage (fraction of sites filled)
dimers [7]
trimers [6]
k = 4 [6]
k = 10 [6]
k = 100 [6]
k = 1000 [6]
k = 10000 [6]
k = 100000 [6]
k = [1]

Asymptotic behavior: .

Saturation coverage of segments of two lengths on a one dimensional continuum

R = size ratio of segments. Assume equal rates of adsorption

systemSaturated coverage (fraction of line filled)
R = 10.74759792 [1]
R = 1.050.7544753(62) [9]
R = 1.10.7599829(63) [9]
R = 20.7941038(58) [9]

Saturation coverage of k-mers on a 2d square lattice

systemSaturated coverage (fraction of sites filled)
dimers k = 20.906820(2), [10] 0.906, [11] 0.9068, [12] 0.9062, [13] 0.906, [14] 0.905(9), [15] 0.906, [11] 0.906823(2), [16]
trimers k = 3 [6] 0.846, [11] 0.8366 [12]
k = 40.8094 [13] 0.81 [11]
k = 50.7868 [11]
k = 60.7703 [11]
k = 70.7579 [11]
k = 80.7479, [13] 0.747 [11]
k = 90.7405 [11]
k = 160.7103, [13] 0.71 [11]
k = 320.6892, [13] 0.689, [11] 0.6893(4) [17]
k = 480.6809(5), [17]
k = 640.6755, [13] 0.678, [11] 0.6765(6) [17]
k = 960.6714(5) [17]
k = 1280.6686, [13] 0.668(9), [15] 0.668 [11] 0.6682(6) [17]
k = 1920.6655(7) [17]
k = 2560.6628 [13] 0.665, [11] 0.6637(6) [17]
k = 3840.6634(6) [17]
k = 5120.6618, [13] 0.6628(9) [17]
k = 10240.6592 [13]
k = 20480.6596 [13]
k = 40960.6575 [13]
k = 81920.6571 [13]
k = 163840.6561 [13]
k = ∞0.660(2), [17] 0.583(10), [18]

Asymptotic behavior: .

Saturation coverage of k-mers on a 2d triangular lattice

systemSaturated coverage (fraction of sites filled)
dimers k = 20.9142(12), [19]
k = 30.8364(6), [19]
k = 40.7892(5), [19]
k = 50.7584(6), [19]
k = 60.7371(7), [19]
k = 80.7091(6), [19]
k = 100.6912(6), [19]
k = 120.6786(6), [19]
k = 200.6515(6), [19]
k = 300.6362(6), [19]
k = 400.6276(6), [19]
k = 500.6220(7), [19]
k = 600.6183(6), [19]
k = 700.6153(6), [19]
k = 800.6129(7), [19]
k = 900.6108(7), [19]
k = 1000.6090(8), [19]
k = 1280.6060(13), [19]

Saturation coverage for particles with neighbors exclusion on 2d lattices

systemSaturated coverage (fraction of sites filled)
Square lattice with NN exclusion0.3641323(1), [20] 0.36413(1), [21] 0.3641330(5), [22]
Honeycomb lattice with NN exclusion0.37913944(1), [20] 0.38(1), [2] 0.379 [23]

.

Saturation coverage of squares on a 2d square lattice

systemSaturated coverage (fraction of sites filled)
k = 20.74793(1), [24] 0.747943(37), [25] 0.749(1), [26]
k = 30.67961(1), [24] 0.681(1), [26]
k = 40.64793(1), [24] 0.647927(22) [25] 0.646(1), [26]
k = 50.62968(1) [24] 0.628(1), [26]
k = 80.603355(55) [25] 0.603(1), [26]
k = 100.59476(4) [24] 0.593(1), [26]
k = 150.583(1), [26]
k = 160.582233(39) [25]
k = 200.57807(5) [24] 0.578(1), [26]
k = 300.574(1), [26]
k = 320.571916(27) [25]
k = 500.56841(10) [24]
k = 640.567077(40) [25]
k = 1000.56516(10) [24]
k = 1280.564405(51) [25]
k = 2560.563074(52) [25]
k = 5120.562647(31) [25]
k = 10240.562346(33) [25]
k = 40960.562127(33) [25]
k = 163840.562038(33) [25]

For k = ∞, see "2d aligned squares" below. Asymptotic behavior: [25] . See also [27]

Saturation coverage for randomly oriented 2d systems

systemSaturated coverage
equilateral triangles0.52590(4) [28]
squares0.523-0.532, [29] 0.530(1), [30] 0.530(1), [31] 0.52760(5) [28]
regular pentagons0.54130(5) [28]
regular hexagons0.53913(5) [28]
regular heptagons0.54210(6) [28]
regular octagons0.54238(5) [28]
regular enneagons0.54405(5) [28]
regular decagons0.54421(6) [28]

2d oblong shapes with maximal coverage

systemaspect ratioSaturated coverage
rectangle1.6180.553(1) [32]
dimer1.50980.5793(1) [33]
ellipse2.00.583(1) [32]
spherocylinder1.750.583(1) [32]
smoothed dimer1.63470.5833(5) [34]

Saturation coverage for 3d systems

systemSaturated coverage
spheres0.3841307(21), [35] 0.38278(5), [36] 0.384(1) [37]
randomly oriented cubes0.3686(15), [38] 0.36306(60) [39]
randomly oriented cuboids 0.75:1:1.30.40187(97), [39]

Saturation coverages for disks, spheres, and hyperspheres

systemSaturated coverage
2d disks0.5470735(28), [35] 0.547067(3), [40] 0.547070, [41] 0.5470690(7), [42] 0.54700(6), [36] 0.54711(16), [43] 0.5472(2), [44] 0.547(2), [45] 0.5479, [16]
3d spheres0.3841307(21), [35] 0.38278(5), [36] 0.384(1) [37]
4d hyperspheres0.2600781(37), [35] 0.25454(9), [36]
5d hyperspheres0.1707761(46), [35] 0.16102(4), [36]
6d hyperspheres0.109302(19), [35] 0.09394(5), [36]
7d hyperspheres0.068404(16), [35]
8d hyperspheres0.04230(21), [35]

Saturation coverages for aligned squares, cubes, and hypercubes

systemSaturated coverage
2d aligned squares0.562009(4), [25] 0.5623(4), [16] 0.562(2), [45] 0.5565(15), [46] 0.5625(5), [47] 0.5444(24), [48] 0.5629(6), [49] 0.562(2), [50]
3d aligned cubes0.4227(6), [50] 0.42(1), [51] 0.4262, [52] 0.430(8), [53] 0.422(8), [54] 0.42243(5) [38]
4d aligned hypercubes0.3129, [50] 0.3341, [52]

See also

Related Research Articles

<span class="mw-page-title-main">Bose–Einstein condensate</span> State of matter

In condensed matter physics, a Bose–Einstein condensate (BEC) is a state of matter that is typically formed when a gas of bosons at very low densities is cooled to temperatures very close to absolute zero. Under such conditions, a large fraction of bosons occupy the lowest quantum state, at which microscopic quantum mechanical phenomena, particularly wavefunction interference, become apparent macroscopically. More generally, condensation refers to the appearance of macroscopic occupation of one or several states: for example, in BCS theory, a superconductor is a condensate of Cooper pairs. As such, condensation can be associated with phase transition, and the macroscopic occupation of the state is the order parameter.

<span class="mw-page-title-main">Topological order</span> Type of order at absolute zero

In physics, topological order is a kind of order in the zero-temperature phase of matter. Macroscopically, topological order is defined and described by robust ground state degeneracy and quantized non-Abelian geometric phases of degenerate ground states. Microscopically, topological orders correspond to patterns of long-range quantum entanglement. States with different topological orders cannot change into each other without a phase transition.

In physics, the Tsallis entropy is a generalization of the standard Boltzmann–Gibbs entropy. It is proportional to the expectation of the q-logarithm of a distribution.

Quantum metrology is the study of making high-resolution and highly sensitive measurements of physical parameters using quantum theory to describe the physical systems, particularly exploiting quantum entanglement and quantum squeezing. This field promises to develop measurement techniques that give better precision than the same measurement performed in a classical framework. Together with quantum hypothesis testing, it represents an important theoretical model at the basis of quantum sensing.

The Bose–Hubbard model gives a description of the physics of interacting spinless bosons on a lattice. It is closely related to the Hubbard model that originated in solid-state physics as an approximate description of superconducting systems and the motion of electrons between the atoms of a crystalline solid. The model was introduced by Gersch and Knollman in 1963 in the context of granular superconductors. The model rose to prominence in the 1980s after it was found to capture the essence of the superfluid-insulator transition in a way that was much more mathematically tractable than fermionic metal-insulator models.

<span class="mw-page-title-main">Percolation threshold</span> Threshold of percolation theory models

The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability p, or more generally a critical surface for a group of parameters p1, p2, ..., such that infinite connectivity (percolation) first occurs.

<span class="mw-page-title-main">One-way quantum computer</span> Method of quantum computing

The one-way or measurement-based quantum computer (MBQC) is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

The eta and eta prime meson are isosinglet mesons made of a mixture of up, down and strange quarks and their antiquarks. The charmed eta meson and bottom eta meson are similar forms of quarkonium; they have the same spin and parity as the (light)
η
defined, but are made of charm quarks and bottom quarks respectively. The top quark is too heavy to form a similar meson, due to its very fast decay.

In applied mathematics, the numerical sign problem is the problem of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near-cancellation of the positive and negative contributions to the integral. Each has to be integrated to very high precision in order for their difference to be obtained with useful accuracy.

Mitsutaka Fujita was a Japanese physicist. He proposed the edge state that is unique to graphene zigzag edges. Also, he theoretically pointed out the importance and peculiarity of nanoscale and edge shape effects in nanographene. The theoretical concept of graphene nanoribbons was introduced by him and his research group to study the nanoscale effect of graphene. He was an associate professor at Tsukuba University, and died of a subarachnoid hemorrhage on March 18, 1998. His posthumous name is Rikakuin-Shinju-Houkou-Koji (理覚院深珠放光居士) in Japanese.

The hexatic phase is a state of matter that is between the solid and the isotropic liquid phases in two dimensional systems of particles. It is characterized by two order parameters: a short-range positional and a quasi-long-range orientational (sixfold) order. More generally, a hexatic is any phase that contains sixfold orientational order, in analogy with the nematic phase.

The spin stiffness or spin rigidity or helicity modulus or the "superfluid density" is a constant which represents the change in the ground state energy of a spin system as a result of introducing a slow in plane twist of the spins. The importance of this constant is in its use as an indicator of quantum phase transitions—specifically in models with metal-insulator transitions such as Mott insulators. It is also related to other topological invariants such as the Berry phase and Chern numbers as in the Quantum Hall effect.

<span class="mw-page-title-main">Subir Sachdev</span> Indian physicist

Subir Sachdev is Herchel Smith Professor of Physics at Harvard University specializing in condensed matter. He was elected to the U.S. National Academy of Sciences in 2014, and received the Lars Onsager Prize from the American Physical Society and the Dirac Medal from the ICTP in 2018. He was a co-editor of the Annual Review of Condensed Matter Physics from 2017–2019.

Multi-particle collision dynamics (MPC), also known as stochastic rotation dynamics (SRD), is a particle-based mesoscale simulation technique for complex fluids which fully incorporates thermal fluctuations and hydrodynamic interactions. Coupling of embedded particles to the coarse-grained solvent is achieved through molecular dynamics.

<span class="mw-page-title-main">Luttinger's theorem</span>

In condensed matter physics, Luttinger's theorem is a result derived by J. M. Luttinger and J. C. Ward in 1960 that has broad implications in the field of electron transport. It arises frequently in theoretical models of correlated electrons, such as the high-temperature superconductors, and in photoemission, where a metal's Fermi surface can be directly observed.

In condensed matter physics, a quantum spin liquid is a phase of matter that can be formed by interacting quantum spins in certain magnetic materials. Quantum spin liquids (QSL) are generally characterized by their long-range quantum entanglement, fractionalized excitations, and absence of ordinary magnetic order.

The Vicsek model is a mathematical model used to describe active matter. One motivation of the study of active matter by physicists is the rich phenomenology associated to this field. Collective motion and swarming are among the most studied phenomena. Within the huge number of models that have been developed to catch such behavior from a microscopic description, the most famous is the model introduced by Tamás Vicsek et al. in 1995.

<span class="mw-page-title-main">Salvatore Torquato</span> American theoretical scientist

Salvatore Torquato is an American theoretical scientist born in Falerna, Italy. His research work has impacted a variety of fields, including physics, chemistry, applied and pure mathematics, materials science, engineering, and biological physics. He is the Lewis Bernard Professor of Natural Sciences in the department of chemistry and Princeton Institute for the Science and Technology of Materials at Princeton University. He has been a senior faculty fellow in the Princeton Center for Theoretical Science, an enterprise dedicated to exploring frontiers across the theoretical natural sciences. He is also an associated faculty member in three departments or programs at Princeton University: physics, applied and computational mathematics, and mechanical and aerospace engineering. On multiple occasions, he was a member of the schools of mathematics and natural sciences at the Institute for Advanced Study, Princeton, New Jersey.

Hyperuniform materials are characterized by an anomalous suppression of density fluctuations at large scales. More precisely, the vanishing of density fluctuations in the long-wave length limit distinguishes hyperuniform systems from typical gases, liquids, or amorphous solids. Examples of hyperuniformity include all perfect crystals, perfect quasicrystals, and exotic amorphous states of matter.

Replica cluster move in condensed matter physics refers to a family of non-local cluster algorithms used to simulate spin glasses. It is an extension of the Swendsen-Wang algorithm in that it generates non-trivial spin clusters informed by the interaction states on two replicas instead of just one. It is different from the replica exchange method, as it performs a non-local update on a fraction of the sites between the two replicas at the same temperature, while parallel tempering directly exchanges all the spins between two replicas at different temperature. However, the two are often used alongside to achieve state-of-the-art efficiency in simulating spin-glass models.

References

  1. 1 2 3 4 Rényi, A. (1958). "On a one-dimensional problem concerning random space filling". Publ. Math. Inst. Hung. Acad. Sci. 3 (109–127): 30–36.
  2. 1 2 Widom, B. J. (1966). "Random Sequential Addition of Hard Spheres to a Volume". J. Chem. Phys. 44 (10): 3888–3894. Bibcode:1966JChPh..44.3888W. doi:10.1063/1.1726548.
  3. Evans, J. W. (1993). "Random and cooperative sequential adsorption". Rev. Mod. Phys. 65 (4): 1281–1329. Bibcode:1993RvMP...65.1281E. doi:10.1103/RevModPhys.65.1281.
  4. Weisstein, Eric W., "Rényi's Parking Constants", From MathWorld--A Wolfram Web Resource
  5. Palasti, I. (1960). "On some random space filling problems". Publ. Math. Inst. Hung. Acad. Sci. 5: 353–359.
  6. 1 2 3 4 5 6 7 8 9 Krapivsky, P.; S. Redner; E. Ben-Naim (2010). A Kinetic View of Statistical Physics. Cambridge Univ. Press.
  7. 1 2 Flory, P. J. (1939). "Intramolecular Reaction between Neighboring Substituents of Vinyl Polymers". J. Am. Chem. Soc. 61 (6): 1518–1521. doi:10.1021/ja01875a053.
  8. Ziff, Robert M.; R. Dennis Vigil (1990). "Kinetics and fractal properties of the random sequential adsorption of line segments". J. Phys. A: Math. Gen. 23 (21): 5103–5108. Bibcode:1990JPhA...23.5103Z. doi:10.1088/0305-4470/23/21/044. hdl: 2027.42/48820 .
  9. 1 2 3 Araujo, N. A. M.; Cadilhe, A. (2006). "Gap-size distribution functions of a random sequential adsorption model of segments on a line". Phys. Rev. E. 73 (5): 051602. arXiv: cond-mat/0404422 . Bibcode:2006PhRvE..73e1602A. doi:10.1103/PhysRevE.73.051602. PMID   16802941. S2CID   8046084.
  10. Wang, Jian-Sheng; Pandey, Ras B. (1996). "Kinetics and jamming coverage in a random sequential adsorption of polymer chains". Phys. Rev. Lett. 77 (9): 1773–1776. arXiv: cond-mat/9605038 . Bibcode:1996PhRvL..77.1773W. doi:10.1103/PhysRevLett.77.1773. PMID   10063168. S2CID   36659964.
  11. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Tarasevich, Yuri Yu; Laptev, Valeri V.; Vygornitskii, Nikolai V.; Lebovka, Nikolai I. (2015). "Impact of defects on percolation in random sequential adsorption of linear k-mers on square lattices". Phys. Rev. E. 91 (1): 012109. arXiv: 1412.7267 . Bibcode:2015PhRvE..91a2109T. doi:10.1103/PhysRevE.91.012109. PMID   25679572. S2CID   35537612.
  12. 1 2 Nord, R. S.; Evans, J. W. (1985). "Irreversible immobile random adsorption of dimers, trimers, ... on 2D lattices". J. Chem. Phys. 82 (6): 2795–2810. Bibcode:1985JChPh..82.2795N. doi: 10.1063/1.448279 .
  13. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Slutskii, M. G.; Barash, L. Yu.; Tarasevich, Yu. Yu. (2018). "Percolation and jamming of random sequential adsorption samples of large linear k-mers on a square lattice". Physical Review E. 98 (6): 062130. arXiv: 1810.06800 . Bibcode:2018PhRvE..98f2130S. doi:10.1103/PhysRevE.98.062130. S2CID   53709717.
  14. Vandewalle, N.; Galam, S.; Kramer, M. (2000). "A new universality for random sequential deposition of needles". Eur. Phys. J. B. 14 (3): 407–410. arXiv: cond-mat/0004271 . Bibcode:2000EPJB...14..407V. doi:10.1007/s100510051047. S2CID   11142384.
  15. 1 2 Lebovka, Nikolai I.; Karmazina, Natalia; Tarasevich, Yuri Yu; Laptev, Valeri V. (2011). "Random sequential adsorption of partially oriented linear k-mers on a square lattice". Phys. Rev. E. 85 (6): 029902. arXiv: 1109.3271 . Bibcode:2011PhRvE..84f1603L. doi:10.1103/PhysRevE.84.061603. PMID   22304098. S2CID   25377751.
  16. 1 2 3 Wang, J. S. (2000). "Series expansion and computer simulation studies of random sequential adsorption". Colloids and Surfaces A. 165 (1–3): 325–343. arXiv: cond-mat/9903139 . doi:10.1016/S0927-7757(99)00444-6.
  17. 1 2 3 4 5 6 7 8 9 10 Bonnier, B.; Hontebeyrie, M.; Leroyer, Y.; Meyers, Valeri C.; Pommiers, E. (1994). "Random sequential adsorption of partially oriented linear k-mers on a square lattice". Phys. Rev. E. 49 (1): 305–312. arXiv: cond-mat/9307043 . doi:10.1103/PhysRevE.49.305. PMID   9961218. S2CID   131089.
  18. Manna, S. S.; Svrakic, N. M. (1991). "Random sequential adsorption: line segments on the square lattice". J. Phys. A: Math. Gen. 24 (12): L671–L676. Bibcode:1991JPhA...24L.671M. doi:10.1088/0305-4470/24/12/003.
  19. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Perino, E. J.; Matoz-Fernandez, D. A.; Pasinetti1, P. M.; Ramirez-Pastor, A. J. (2017). "Jamming and percolation in random sequential adsorption of straight rigid rods on a two-dimensional triangular lattice". Journal of Statistical Mechanics: Theory and Experiment. 2017 (7): 073206. arXiv: 1703.07680 . Bibcode:2017JSMTE..07.3206P. doi:10.1088/1742-5468/aa79ae. S2CID   119374271.{{cite journal}}: CS1 maint: numeric names: authors list (link)
  20. 1 2 Gan, C. K.; Wang, J.-S. (1998). "Extended series expansions for random sequential adsorption". J. Chem. Phys. 108 (7): 3010–3012. arXiv: cond-mat/9710340 . Bibcode:1998JChPh.108.3010G. doi:10.1063/1.475687. S2CID   97703000.
  21. Meakin, P.; Cardy, John L.; Loh, John L.; Scalapino, John L. (1987). "Extended series expansions for random sequential adsorption". J. Chem. Phys. 86 (4): 2380–2382. doi:10.1063/1.452085.
  22. Baram, Asher; Fixman, Marshall (1995). "Random sequential adsorption: Long time dynamics". J. Chem. Phys. 103 (5): 1929–1933. Bibcode:1995JChPh.103.1929B. doi:10.1063/1.469717.
  23. Evans, J. W. (1989). "Comment on Kinetics of random sequential adsorption". Phys. Rev. Lett. 62 (22): 2642. Bibcode:1989PhRvL..62.2642E. doi:10.1103/PhysRevLett.62.2642. PMID   10040048.
  24. 1 2 3 4 5 6 7 8 Privman, V.; Wang, J. S.; Nielaba, P. (1991). "Continuum limit in random sequential adsorption". Phys. Rev. B. 43 (4): 3366–3372. Bibcode:1991PhRvB..43.3366P. doi:10.1103/PhysRevB.43.3366. PMID   9997649.
  25. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Brosilow, B. J.; R. M. Ziff; R. D. Vigil (1991). "Random sequential adsorption of parallel squares". Phys. Rev. A. 43 (2): 631–638. Bibcode:1991PhRvA..43..631B. doi:10.1103/PhysRevA.43.631. PMID   9905079.
  26. 1 2 3 4 5 6 7 8 9 Nakamura, Mitsunobu (1986). "Random sequential packing in square cellular structures". J. Phys. A: Math. Gen. 19 (12): 2345–2351. Bibcode:1986JPhA...19.2345N. doi:10.1088/0305-4470/19/12/020.
  27. Sutton, Clifton (1989). "Asymptotic packing densities for two-dimensional lattice models". Stochastic Models. 5 (4): 601–615. doi:10.1080/15326348908807126.
  28. 1 2 3 4 5 6 7 8 Zhang, G. (2018). "Precise algorithm to generate random sequential adsorption of hard polygons at saturation". Physical Review E. 97 (4): 043311. arXiv: 1803.08348 . Bibcode:2018PhRvE..97d3311Z. doi:10.1103/PhysRevE.97.043311. PMID   29758708. S2CID   46892756.
  29. Vigil, R. Dennis; Robert M. Ziff (1989). "Random sequential adsorption of unoriented rectangles onto a plane". J. Chem. Phys. 91 (4): 2599–2602. Bibcode:1989JChPh..91.2599V. doi:10.1063/1.457021. hdl: 2027.42/70834 .
  30. Viot, P.; G. Targus (1990). "Random Sequential Addition of Unoriented Squares: Breakdown of Swendsen's Conjecture". EPL. 13 (4): 295–300. Bibcode:1990EL.....13..295V. doi:10.1209/0295-5075/13/4/002. S2CID   250852782.
  31. Viot, P.; G. Targus; S. M. Ricci; J. Talbot (1992). "Random sequential adsorption of anisotropic particles. I. Jamming limit and asymptotic behavior". J. Chem. Phys. 97 (7): 5212. Bibcode:1992JChPh..97.5212V. doi:10.1063/1.463820.
  32. 1 2 3 Viot, P.; G. Tarjus; S. Ricci; J.Talbot (1992). "Random sequential adsorption of anisotropic particles. I. Jamming limit and asymptotic behavior". J. Chem. Phys. 97 (7): 5212–5218. Bibcode:1992JChPh..97.5212V. doi:10.1063/1.463820.
  33. Cieśla, Michał (2014). "Properties of random sequential adsorption of generalized dimers". Phys. Rev. E. 89 (4): 042404. arXiv: 1403.3200 . Bibcode:2014PhRvE..89d2404C. doi:10.1103/PhysRevE.89.042404. PMID   24827257. S2CID   12961099.
  34. Ciesśla, Michałl; Grzegorz Pająk; Robert M. Ziff (2015). "Shapes for maximal coverage for two-dimensional random sequential adsorption". Phys. Chem. Chem. Phys. 17 (37): 24376–24381. arXiv: 1506.08164 . Bibcode:2015PCCP...1724376C. doi:10.1039/c5cp03873a. PMID   26330194. S2CID   14368653.
  35. 1 2 3 4 5 6 7 8 Zhang, G.; S. Torquato (2013). "Precise algorithm to generate random sequential addition of hard hyperspheres at saturation". Phys. Rev. E. 88 (5): 053312. arXiv: 1402.4883 . Bibcode:2013PhRvE..88e3312Z. doi:10.1103/PhysRevE.88.053312. PMID   24329384. S2CID   14810845.
  36. 1 2 3 4 5 6 Torquato, S.; O. U. Uche; F. H. Stillinger (2006). "Random sequential addition of hard spheres in high Euclidean dimensions". Phys. Rev. E. 74 (6): 061308. arXiv: cond-mat/0608402 . Bibcode:2006PhRvE..74f1308T. doi:10.1103/PhysRevE.74.061308. PMID   17280063. S2CID   15604775.
  37. 1 2 Meakin, Paul (1992). "Random sequential adsorption of spheres of different sizes". Physica A. 187 (3): 475–488. Bibcode:1992PhyA..187..475M. doi:10.1016/0378-4371(92)90006-C.
  38. 1 2 Ciesla, Michal; Kubala, Piotr (2018). "Random sequential adsorption of cubes". The Journal of Chemical Physics. 148 (2): 024501. Bibcode:2018JChPh.148b4501C. doi:10.1063/1.5007319. PMID   29331110.
  39. 1 2 Ciesla, Michal; Kubala, Piotr (2018). "Random sequential adsorption of cuboids". The Journal of Chemical Physics. 149 (19): 194704. Bibcode:2018JChPh.149s4704C. doi:10.1063/1.5061695. PMID   30466287. S2CID   53727841.
  40. Cieśla, Michał; Ziff, Robert (2018). "Boundary conditions in random sequential adsorption". Journal of Statistical Mechanics: Theory and Experiment. 2018 (4): 043302. arXiv: 1712.09663 . Bibcode:2018JSMTE..04.3302C. doi:10.1088/1742-5468/aab685. S2CID   118969644.
  41. Cieśla, Michał; Aleksandra Nowak (2016). "Managing numerical errors in random sequential adsorption". Surface Science. 651: 182–186. Bibcode:2016SurSc.651..182C. doi:10.1016/j.susc.2016.04.014.
  42. Wang, Jian-Sheng (1994). "A fast algorithm for random sequential adsorption of discs". Int. J. Mod. Phys. C. 5 (4): 707–715. arXiv: cond-mat/9402066 . Bibcode:1994IJMPC...5..707W. doi:10.1142/S0129183194000817. S2CID   119032105.
  43. Chen, Elizabeth R.; Miranda Holmes-Cerfon (2017). "Random Sequential Adsorption of Discs on Surfaces of Constant Curvature: Plane, Sphere, Hyperboloid, and Projective Plane". J. Nonlinear Sci. 27 (6): 1743–1787. arXiv: 1709.05029 . Bibcode:2017JNS....27.1743C. doi:10.1007/s00332-017-9385-2. S2CID   26861078.
  44. Hinrichsen, Einar L.; Jens Feder; Torstein Jøssang (1990). "Random packing of disks in two dimensions". Phys. Rev. A. 41 (8): 4199–4209. Bibcode:1990PhRvA..41.4199H. doi:10.1103/PhysRevA.41.4199.
  45. 1 2 Feder, Jens (1980). "Random sequential adsorption". J. Theor. Biol. 87 (2): 237–254. Bibcode:1980JThBi..87..237F. doi:10.1016/0022-5193(80)90358-6.
  46. Blaisdell, B. Edwin; Herbert Solomon (1970). "On random sequential packing in the plane and a conjecture of Palasti". J. Appl. Probab. 7 (3): 667–698. doi:10.1017/S0021900200110630.
  47. Dickman, R.; J. S. Wang; I. Jensen (1991). "Random sequential adsorption of parallel squares". J. Chem. Phys. 94 (12): 8252. Bibcode:1991JChPh..94.8252D. doi:10.1063/1.460109.
  48. Tory, E. M.; W. S. Jodrey; D. K. Pikard (1983). "Simulation of Random Sequential Adsorption: Efficient Methods and Resolution of Conflicting Results". J. Theor. Biol. 102 (12): 439–445. Bibcode:1991JChPh..94.8252D. doi:10.1063/1.460109.
  49. Akeda, Yoshiaki; Motoo Hori (1976). "On random sequential packing in two and three dimensions". Biometrika. 63 (2): 361–366. doi:10.1093/biomet/63.2.361.
  50. 1 2 3 Jodrey, W. S.; E. M. Tory (1980). "Random sequential packing in R^n". Journal of Statistical Computation and Simulation. 10 (2): 87–93. doi:10.1080/00949658008810351.
  51. Bonnier, B.; M. Hontebeyrie; C. Meyers (1993). "On the random filling of R^d by non-overlapping d-dimensional cubes". Physica A. 198 (1): 1–10. arXiv: cond-mat/9302023 . Bibcode:1993PhyA..198....1B. doi:10.1016/0378-4371(93)90180-C. S2CID   11802063.
  52. 1 2 Blaisdell, B. Edwin; Herbert Solomon (1982). "Random Sequential Packing in Euclidean Spaces of Dimensions Three and Four and a Conjecture of Palásti". Journal of Applied Probability. 19 (2): 382–390. doi:10.2307/3213489. JSTOR   3213489. S2CID   118248194.
  53. Cooper, Douglas W. (1989). "Random sequential packing simulations in three dimensions for aligned cubes". J. Appl. Probab. 26 (3): 664–670. doi:10.2307/3214426. JSTOR   3214426. S2CID   124311298.
  54. Nord, R. S. (1991). "Irreversible random sequential filling of lattices by Monte Carlo simulation". Journal of Statistical Computation and Simulation. 39 (4): 231–240. doi:10.1080/00949659108811358.