Random sequential adsorption on Euclidean, fractal, and random lattices

Random sequential adsorption with correlated defects : A series expansion approach

The random sequential adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here the problem of the one-dimensional RSA of k-mers onto a substrate with correlated defects controlled by uniform and power-law distributions is theoretically investigated: the coverage fraction is obtained as a function of the density of defects and several scaling laws are examined. The results are compared with extensive Monte Carlo simulations and more traditional methods based on master equations. Emphasis is given in elucidating the scaling behavior of the fluctuations of the coverage fraction. The phenomenon of universality breaking and the issues of conventional Gaussian fluctuations and the Lévy type fluctuations from a simple perspective, relying on the central limit theorem, are also addressed.

Standard and inverse site percolation of triangular tiles on triangular lattices: Isotropic and perfectly oriented deposition and removal

Numerical simulations and finite-size scaling analysis have been carried out to study standard and inverse percolation of triangular tiles of side k (k-tiles) on triangular lattices. In the case of standard percolation, the lattice is initially empty. Then, k-tiles are randomly and sequentially deposited on the lattice. In the case of inverse percolation, the process starts with an initial configuration where all lattice sites are occupied by single monomers (each monomer occupies one lattice site) and, consequently, the opposite sides of the lattice are connected by nearest-neighbor occupied sites. Then, the system is diluted by randomly removing k-tiles [composed by k(k+1)/2 monomers] from the lattice. Two schemes are used for the depositing and removing process: the isotropic scheme, where the deposition (removal) of the objects occurs with the same probability in any lattice direction; and the anisotropic (perfectly oriented or nematic) scheme, where one lattice direction is privileged for depositing (removing) the tiles. The study is conducted by following the behavior of four critical concentrations with the size k: (i) [(ii)] standard isotropic (oriented) percolation threshold θ_{c,k} (ϑ_{c,k}), which represents the minimum concentration of occupied sites at which an infinite cluster of occupied nearest-neighbor sites extends from one side of the system to the other. θ_{c,k} (ϑ_{c,k}) is reached by isotropic (oriented) deposition of k-tiles on an initially empty lattice; and (iii) [(iv)] inverse isotropic (oriented) percolation threshold θ_{c,k}^{i} (ϑ_{c,k}^{i}), which corresponds to the maximum concentration of occupied sites for which connectivity disappears. θ_{c,k}^{i} (ϑ_{c,k}^{i}) is reached after removing isotropic (completely aligned) k-tiles from an initially fully occupied lattice. The obtained results indicate that (1)θ_{c,k} (θ_{c,k}^{i}) is an increasing (decreasing) function of k in the range 1≤k≤6. For k≥7, all jammed configurations are nonpercolating (percolating) states and, consequently, the percolation phase transition disappears. (2)ϑ_{c,k} (ϑ_{c,k}^{i}) show a behavior qualitatively similar to that observed for isotropic deposition. In this case, the minimum value of k at which the phase transition disappears is k=5. (3) For both isotropic and perfectly oriented models, the curves of standard and inverse percolation thresholds are symmetric to each other with respect to the line θ(ϑ)=0.5. Thus, a complementary property is found θ_{c,k}+θ_{c,k}^{i}=1 (and ϑ_{c,k}+ϑ_{c,k}^{i}=1), which has not been observed in other regular lattices. (4) Finally, in all cases, the jamming exponent ν_{j} was measured, being ν_{j}=1 regardless of the orientation (isotropic or nematic) or the size k considered. In addition, the accurate determination of the critical exponents ν, β, and γ reveals that the percolation phase transition involved in the system, which occurs for k varying between one and five (three) for isotropic (nematic) deposition scheme, has the same universality class as the standard percolation problem.

Jamming densities of random sequential adsorption on d-dimensional cubic lattices

The rate of convergence of the jamming densities to their asymptotic high-dimensional tree approximation is studied, for two types of random sequential adsorption (RSA) processes on a d-dimensional cubic lattice. The first RSA process has an exclusion shell around a particle of nearest neighbors in all d dimensions (N1 model). In the second process the exclusion shell consists of a d-dimensional hypercube with length k=2 around a particle (N2 model). For the N1 model the deviation of the jamming density ρ_{r}(d) from its asymptotic high d value ρ_{asy}(d)=ln(1+2d)/2d vanishes as [ln(1+2d)/2d]^{3.41}. In addition, it has been shown that the coefficients a_{n}(d) of the short-time expansion of the occupation density of this model (at least up to n=6) are given for all d by a finite correction sum of order (n-2) in 1/d to their asymptotic high d limit. The convergence rate of the jamming densities of the N2 model to their high d limits ρ_{asy}(d)=dln3/3^{d} is slow. For 2≤d≤4 the generalized Palasti approximation provides by far a better approximation. For higher d values the jamming densities converge monotonically to the above asymptotic limits, and their decay with d is clearly faster than the decay as (0.432332...)^{d} predicted by the generalized Palasti approximation.

Breaking universality in random sequential adsorption on a square lattice with long-range correlated defects

Jamming and percolation transitions in the standard random sequential adsorption of particles on regular lattices are characterized by a universal set of critical exponents. The universality class is preserved even in the presence of randomly distributed defective sites that are forbidden for particle deposition. However, using large-scale Monte Carlo simulations by depositing dimers on the square lattice and employing finite-size scaling, we provide evidence that the system does not exhibit such well-known universal features when the defects have spatial long-range (power-law) correlations. The critical exponents ν_{j} and ν associated with the jamming and percolation transitions, respectively, are found to be nonuniversal for strong spatial correlations and approach systematically their own universal values as the correlation strength is decreased. More crucially, we have found a difference in the values of the percolation correlation length exponent ν for a small but finite density of defects with strong spatial correlations. Furthermore, for a fixed defect density, it is found that the percolation threshold of the system, at which the largest cluster of absorbed dimers first establishes the global connectivity, gets reduced with increasing the strength of the spatial correlation.

Nonlinear dynamical modeling of adsorption and desorption processes with power-law kinetics: Application to CO_{2} capture

Modeling of random sequential adsorption (RSA) process is studied in this paper as this kind of process is close to the surface adsorption phenomenon that is, for instance, exploited in gas sensors or for liquid or gas purification. Analysis and simulation of the RSA process is first performed to highlight a power-law kinetic behavior. Such behaviors are often modeled in the literature with fractional models. The paper, however, shows that fractional models are not able to capture some important properties of the RSA process. A nonlinear model and the associated parameters tuning method are, thus, proposed. A discussion on the ability of the proposed model to capture the power-law kinetics without exhibiting some of the drawbacks of fractional models is proposed. This nonlinear model is then modified to take into account the reverse desorption process. The proposed modeling approach is applied to experimental data of CO_{2} capture.

Jamming and percolation of linear k-mers on honeycomb lattices

Numerical simulations and finite-size scaling analysis have been performed to study the jamming and percolation behavior of elongated objects deposited on two-dimensional honeycomb lattices. The depositing particle is modeled as a linear array of length k (so-called k-mer), maximizing the distance between first and last monomers in the chain. The separation between k-mer units is equal to the lattice constant. Hence, k sites are occupied by a k-mer when adsorbed onto the surface. The adsorption process starts with an initial configuration, where all lattice sites are empty. Then, the sites are occupied following a random sequential adsorption mechanism. The process finishes when the jamming state is reached and no more objects can be deposited due to the absence of empty site clusters of appropriate size and shape. Jamming coverage θ_{j,k} and percolation threshold θ_{c,k} were determined for a wide range of values of k (2≤k≤128). The obtained results shows that (i) θ_{j,k} is a decreasing function with increasing k, being θ_{j,k→∞}=0.6007(6) the limit value for infinitely long k-mers; and (ii) θ_{c,k} has a strong dependence on k. It decreases in the range 2≤k<48, goes through a minimum around k=48, and increases smoothly from k=48 up to the largest studied value of k=128. Finally, the precise determination of the critical exponents ν, β, and γ indicates that the model belongs to the same universality class as 2D standard percolation regardless of the value of k considered.

Irreversible bilayer adsorption of straight semirigid rods on two-dimensional square lattices: Jamming and percolation properties

Numerical simulations and finite-size scaling analysis have been performed to study the jamming and percolation behavior of straight semirigid rods adsorbed on two-dimensional square lattices. The depositing objects can be adsorbed on the surface forming two layers. The filling of the lattice is carried out following a generalized random sequential adsorption (RSA) mechanism. In each elementary step, (i) a set of k consecutive nearest-neighbor sites (aligned along one of two lattice axes) is randomly chosen and (ii) if each selected site is either empty or occupied by a k-mer unit in the first layer, then a new k-mer is then deposited onto the lattice. Otherwise, the attempt is rejected. The process starts with an initially empty lattice and continues until the jamming state is reached and no more objects can be deposited due to the absence of empty site clusters of appropriate size and shape. A wide range of values of k (2≤k≤64) is investigated. The study of the kinetic properties of the system shows that (1) the jamming coverage θ_{j,k} is a decreasing function with increasing k, with θ_{j,k→∞}=0.7299(21) the limit value for infinitely long k-mers and (2) the jamming exponent ν_{j} remains close to 1, regardless of the size k considered. These findings are discussed in terms of the lattice dimensionality and number of sites available for adsorption. The dependence of the percolation threshold θ_{c,k} as a function of k is also determined, with θ_{c,k}=A+Bexp(-k/C), where A=θ_{c,k→∞}=0.0457(68) is the value of the percolation threshold by infinitely long k-mers, B=0.276(25), and C=14(2). This monotonic decreasing behavior is completely different from that observed for the standard problem of straight rods on square lattices, where the percolation threshold shows a nonmonotonic k-mer size dependence. The differences between the results obtained from bilayer and monolayer phases are explained on the basis of the transversal overlaps between rods occurring in the bilayer problem. This effect (which we call a "cross-linking effect"), its consequences on the filling kinetics, and its implications in the field of conductivity of composites filled with elongated particles (or fibers) are discussed in detail. Finally, the precise determination of the critical exponents ν, β, and γ indicates that, although the increasing in the width of the deposited layer drastically affects the behavior of the percolation threshold with k and other critical properties (such as the crossing points of the percolation probability functions), it does not alter the nature of the percolation transition occurring in the system. Accordingly, the bilayer model belongs to the same universality class as two-dimensional standard percolation model.

Irreversible multilayer adsorption of semirigid k-mers deposited on one-dimensional lattices

Irreversible multilayer adsorption of semirigid k-mers on one-dimensional lattices of size L is studied by numerical simulations complemented by exhaustive enumeration of configurations for small lattices. The deposition process is modeled by using a random sequential adsorption algorithm, generalized to the case of multilayer adsorption. The paper concentrates on measuring the jamming coverage for different values of k-mer size and number of layers n. The bilayer problem (n≤2) is exhaustively analyzed, and the resulting tendencies are validated by the exact enumeration techniques. Then, the study is extended to an increasing number of layers, which is one of the noteworthy parts of this work. The obtained results allow the following: (i) to characterize the structure of the adsorbed phase for the multilayer problem. As n increases, the (1+1)-dimensional adsorbed phase tends to be a "partial wall" consisting of "towers" (or columns) of width k, separated by valleys of empty sites. The length of these valleys diminishes with increasing k; (ii) to establish that this is an in-registry adsorption process, where each incoming k-mer is likely to be adsorbed exactly onto an already adsorbed one. With respect to percolation, our calculations show that the percolation probability vanishes as L increases, being zero in the limit L→∞. Finally, the value of the jamming critical exponent ν_{j} is reported here for multilayer adsorption: ν_{j} remains close to 2 regardless of the considered values of k and n. This finding is discussed in terms of the lattice dimensionality.