Random sequential adsorption

By J. Feder. 1980

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Determinantal Point Processes for Machine Learning (2012, methodology): “tion (RSA) model, which has been used in physics and chemistry to model particles that bind to two-dimensional surfaces, e.g., proteins on a cell membrane [Tanemura, 1979, Finegold and Donnell, 1979, Feder, 1980, Swendsen, 1981, Hinrichsen et al., 1986, Ramsden, 1993]. RSA is described generatively ”
Jammed hard-particle packings: From Kepler to Bernal and beyond (2010, background): “d RSA process. The latter is produced by randomly, irreversibly, and sequentially placing nonoverlapping objects into a large volume in Rd that at some initial time is empty of spheres (Cooper, 1988; Feder, 1980; Viot etal., 1993; Widom, 1966). If an attempt to add a sphere at some time results in a”
Hyperuniform states of matter (2018, methodology): “We have generated realizations of 100,000 particles in two dimensions that start from relative dense but unsaturated nonoverlapping random-sequential-addition of circular disks of diameter a [74, 299, 300] but with an influence circle of radius D > a to allow particle overlaps (active particles).”
STATISTICAL ANALYSIS OF REAL AND SIMULATED FIBRE ARRANGEMENTS IN UNIDIRECTIONAL COMPOSITES (2013, unknown): “55% [20] [21].”
Likelihood-based inference for Matérn type-III repulsive point processes (2009, background): “For more details and some of the historical development, see [5], [7], [8], [22], [24], [25], and [32].”
Perfect simulation and moment properties for the Matérn type III process (2010, background): “Feder (1980) offered empirical evidence for his conjecture that the error in estimating the packing density for the RSA process with n attempts to place a new disk decreased like n in two dimensions.”
Generation of 3D representative volume elements for heterogeneous materials: A review (2018, methodology): “Various researchers employed the algorithm for generating RVEs with spheres [358,356], capsules [358], cylinders [359,360,12], ellipsoids [358,361] or approximations of those shapes via lines or convex polyhedra [12,362].”