Jamming and percolation for deposition of k^{2}-mers on square lattices: A Monte Carlo simulation study

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.

Inverse percolation by removing straight semirigid rods from bilayer square lattices

Numerical simulations and finite-size scaling analysis have been carried out to study the problem of inverse percolation by removing semirigid rods from a L×L square lattice that contains two layers (and M=L×L×2 sites). 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 removing groups of k consecutive monomers according to a generalized random sequential adsorption mechanism. The study is conducted by following the behavior of two critical concentrations with size k: (1) jamming coverage θ_{j,k}, which represents the concentration of occupied sites at which the jamming state is reached, and (2) inverse percolation threshold θ_{c,k}, which corresponds to the maximum concentration of occupied sites for which connectivity disappears. The obtained results indicate that (1) the jamming coverage exhibits an increasing dependence on the size k-it rapidly increases for small values of k and asymptotically converges towards a definite value for infinitely large k sizes θ_{j,k→∞}≈0.2701-and (2) the inverse percolation threshold is a decreasing function of k in the range 1≤k≤17. For k≥18, all jammed configurations are percolating states (the lattice remains connected even when the highest allowed concentration of removed sites is reached) and, consequently, there is no nonpercolating phase. This finding contrasts with the results obtained in literature for a complementary problem, where straight rigid k-mers are randomly and irreversibly deposited on a square lattice forming two layers. In this case, percolating and nonpercolating phases extend to infinity in the space of the parameter k and the model presents percolation transition for the whole range of k. The results obtained in the present study were also compared with those reported for the case of inverse percolation by removal of rigid linear k-mers from a square monolayer. The differences observed between monolayer and bilayer problems were discussed in terms of vulnerability and network robustness. Finally, the accurate determination of the critical exponents ν, β, and γ reveals that the percolation phase transition involved in the system has the same universality class as the standard percolation problem.

Random sequential adsorption of self-avoiding chains on two-dimensional lattices

Random sequential adsorption of extended objects deposited on two-dimensional regular lattices is studied. The depositing objects are chains formed by occupying adsorption sites on the substrate through a self-avoiding walk of k lattice steps; these objects are also called "tortuous k-mers." We study how the jamming coverage, θ_{j,k}, depends on k for lattices with different connectivity (honeycomb, square, and triangular). The dependence can be fitted by the function θ_{j,k}=θ_{j,k→∞}+B/k+C/k^{2}, where B and C are found to be shared parameters by the three lattices and θ_{j,k→∞} (>0) is the jamming coverage for infinitely long k-mers for each of them. The jamming coverage is found to have a growing behavior with the connectivity of the lattice. In addition, θ_{j,k} is found to be higher for tortuous k-mers than for the previously reported for linear k-mers in each lattice. The results were obtained by means of numerical simulation through an efficient algorithm whose characteristics are discussed in detail. The computational method introduced here also allows us to investigate the full-time kinetics of the surface coverage θ_{k}(t) [θ_{j,k}≡θ_{k}(t→∞)]. Along this line, different time regimes are identified and characterized.

Percolation in two-species antagonistic random sequential adsorption in two dimensions

We consider two-species random sequential adsorption (RSA) in which species A and B adsorb randomly on a lattice with the restriction that opposite species cannot occupy nearest-neighbor sites. When the probability x_{A} of choosing an A particle for an adsorption trial reaches a critical value 0.626441(1), the A species percolates and/or the blocked sites X (those with at least one A and one B nearest neighbor) percolate. Analysis of the size-distribution exponent τ, the wrapping probabilities, and the excess cluster number shows that the percolation transition is consistent with that of ordinary percolation. We obtain an exact result for the low x_{B}=1-x_{A} jamming behavior: θ_{A}=1-x_{B}+b_{2}x_{B}^{2}+O(x_{B}^{3}), θ_{B}=x_{B}/(z+1)+O(x_{B}^{2}) for a z-coordinated lattice, where θ_{A} and θ_{B} are, respectively, the saturation coverages of species A and B. We also show how differences between wrapping probabilities of A and X clusters, as well as differences in the number of A and X clusters, can be used to find the percolation transition point accurately.

Random sequential adsorption of oriented rectangles with random aspect ratio

We studied random sequential adsorption (RSA) of parallel rectangles with random aspect ratio but fixed area using a newly developed algorithm that allows to generate strictly saturated packing of this kind. We determined saturated packing fraction for several different distributions of a random variable used for selecting side length ratio of deposited rectangles. It was also shown that the anisotropy of deposited rectangles changes during packing generation. Additionally, we examined the kinetics of packing growth, which near saturation obeys the power law with the exponent 1/d≈1/3, typical for the RSA of unoriented anisotropic shapes on a two-dimensional surface. Kinetics in the low coverage limit is determined using the concept of the available surface function. The microstructural properties of obtained random packings are evaluated in terms of two-point density correlation function.

Surface growth during random and irreversible multilayer deposition of straight semirigid rods

Surface growth properties during irreversible multilayer deposition of straight semirigid rods on linear and square lattices have been studied by Monte Carlo simulations and analytical considerations. The filling of the lattice is carried out following a generalized random sequential adsorption mechanism where the depositing objects can be adsorbed on the surface forming multilayers. The results of our simulations show that the roughness evolves in time following two different behaviors: an "homogeneous growth regime" at initial times, where the heights of the columns homogeneously increase, and a "segmented growth regime" at long times, where the adsorbed phase is segmented in actively growing columns and inactive nongrowing sites. Under these conditions, the surface growth generated by the deposition of particles of different sizes is studied. At long times, the roughness of the systems increases linearly with time, with growth exponent β=1, at variance with a random deposition of monomers which presents a sublinear behavior (β=1/2). The linear behavior is due to the segmented growth process, as we show using a simple analytical model.

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.

Standard and inverse site percolation of straight rigid rods 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 straight rigid rods on triangular lattices. In the case of standard percolation, the lattice is initially empty. Then, linear k-mers (particles occupying k consecutive sites along one of the lattice directions) 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 sets of k consecutive monomers (linear k-mers) from the lattice. Two schemes are used for the depositing/removing process: an isotropic scheme, where the deposition (removal) of the linear objects occurs with the same probability in any lattice direction, and an anisotropic (perfectly oriented) scheme, where one lattice direction is privileged for depositing (removing) the particles. The study is conducted by following the behavior of four critical concentrations with 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 straight rigid k-mers 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] straight rigid k-mers from an initially fully occupied lattice. θ_{c,k}, ϑ_{c,k}, θ_{c,k}^{i}, and ϑ_{c,k}^{i} are determined for a wide range of k (2≤k≤512). The obtained results indicate that (1)θ_{c,k}[θ_{c,k}^{i}] exhibits a nonmonotonous dependence on the size k. It decreases[increases] for small particle sizes, goes through a minimum[maximum] at around k=11, and finally increases and asymptotically converges towards a definite value for large segments θ_{c,k→∞}=0.500(2) [θ_{c,k→∞}^{i}=0.500(1)]; (2)ϑ_{c,k}[ϑ_{c,k}^{i}] depicts a monotonous behavior in terms of k. It rapidly increases[decreases] for small particle sizes and asymptotically converges towards a definite value for infinitely long k-mers ϑ_{c,k→∞}=0.5334(6) [ϑ_{c,k→∞}^{i}=0.4666(6)]; (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. This condition is analytically validated by using exact enumeration of configurations for small systems, and (4) in all cases, the critical concentration curves divide the θ space in a percolating region and a nonpercolating region. These phases extend to infinity in the space of the parameter k so that the model presents percolation transition for the whole range of k.

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.

SuSMoST: Surface Science Modeling and Simulation Toolkit

We present to the scientific community the Surface Science Modeling and Simulation Toolkit (SuSMoST), which includes a number of utilities and implementations of statistical physics algorithms and models. With SuSMoST it is possible to predict or explain the structure and thermodynamic properties of adsorption layers. SuSMoST automatically builds formal graph and tensor-network models based on atomic description of adsorption complexes and helps to do ab initio calculations of interactions between adsorbed species. Using methods of various nature SuSMoST generates representative samples of adsorption layers and computes its thermodynamic quantities such as mean energy, coverage, density, and heat capacity. From these data one can plot phase diagrams of adsorption systems, assess thermal stability of self-assembled structures, simulate thermal desorption spectra, and so forth.

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.

Buckling of a linear chain of hard spheres in a harmonic confining potential: Numerical and analytical results for low and high compression

We extend a previous analysis of the buckling properties of a linear chain of hard spheres between hard walls under transverse harmonic confinement. Two regimes are distinguished-low compression, for which the entire chain buckles, and higher compression, for which there is localized buckling. With further increase of compression, second-neighbor contacts occur; beyond this compression the structure is no longer planar, and is not treated here. A continuous model is developed which is amenable to analytical solution in the low compression regime. This is helpful in understanding the scaling properties of both finite and infinite chains.

Kinetics of random sequential adsorption of two-dimensional shapes on a one-dimensional line

Saturated random sequential adsorption packings built of two-dimensional ellipses, spherocylinders, rectangles, and dimers placed on a one-dimensional line are studied to check analytical prediction concerning packing growth kinetics [A. Baule, Phys. Rev. Lett. 119, 028003 (2017)PRLTAO0031-900710.1103/PhysRevLett.119.028003]. The results show that the kinetics is governed by the power law with the exponent d=1.5 and 2.0 for packings built of ellipses and rectangles, respectively, which is consistent with analytical predictions. However, for spherocylinders and dimers of moderate width-to-height ratio, a transition between these two values is observed. We argue that this transition is a finite-size effect that arises for spherocylinders due to the properties of the contact function. In general, it appears that the kinetics of packing growth can depend on packing size even for very large packings.

Random sequential adsorption on Euclidean, fractal, and random lattices

Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal, and random lattices is studied. The adsorption process is modeled by using random sequential adsorption algorithm. Objects are adsorbed on one-, two-, and three-dimensional Euclidean lattices, on Sierpinski carpets having dimension d between 1 and 2, and on Erdős-Rényi random graphs. The number of sites is M=L^{d} for Euclidean and fractal lattices, where L is a characteristic length of the system. In the case of random graphs, such a characteristic length does not exist, and the substrate can be characterized by a fixed set of M vertices (sites) and an average connectivity (or degree) g. This paper concentrates on measuring (i) the probability W_{L(M)}(θ) that a lattice composed of L^{d}(M) elements reaches a coverage θ and (ii) the exponent ν_{j} characterizing the so-called jamming transition. The results obtained for Euclidean, fractal, and random lattices indicate that the quantities derived from the jamming probability W_{L(M)}(θ), such as (dW_{L}/dθ)_{max} and the inverse of the standard deviation Δ_{L}, behave asymptotically as M^{1/2}. In the case of Euclidean and fractal lattices, where L and d can be defined, the asymptotic behavior can be written as M^{1/2}=L^{d/2}=L^{1/ν_{j}}, with ν_{j}=2/d.

Percolation phase transition by removal of k^{2}-mers from fully occupied lattices

Numerical simulations and finite-size scaling analysis have been carried out to study the problem of inverse site percolation by the removal of k×k square tiles (k^{2}-mers) from square lattices. The process starts with an initial configuration, where all lattice sites are occupied and, obviously, the opposite sides of the lattice are connected by occupied sites. Then the system is diluted by removing k^{2}-mers of occupied sites from the lattice following a random sequential adsorption mechanism. The process finishes when the jamming state is reached and no more objects can be removed due to the absence of occupied sites clusters of appropriate size and shape. The central idea of this paper is based on finding the maximum concentration of occupied sites, p_{c,k}, for which the connectivity disappears. This particular value of the concentration is called the inverse percolation threshold and determines a well-defined geometrical phase transition in the system. The results obtained for p_{c,k} show that the inverse percolation threshold is a decreasing function of k in the range 1≤k≤4. For k≥5, all jammed configurations are percolating states, and consequently, there is no nonpercolating phase. In other words, the lattice remains connected even when the highest allowed concentration of removed sites is reached. The jamming exponent ν_{j} was measured, being ν_{j}=1 regardless of 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 four, has the same universality class as the standard percolation problem.

Jamming and percolation of k^{3}-mers on simple cubic lattices

Jamming and percolation of three-dimensional (3D) k×k×k cubic objects (k^{3}-mers) deposited on simple cubic lattices have been studied by numerical simulations complemented with finite-size scaling theory. The k^{3}-mers were irreversibly deposited into the lattice. Jamming coverage θ_{j,k} was determined for a wide range of k (2≤k≤40). θ_{j,k} exhibits a decreasing behavior with increasing k, being θ_{j,k=∞}=0.4204(9) the limit value for large k^{3}-mer sizes. In addition, a finite-size scaling analysis of the jamming transition was carried out, and the corresponding spatial correlation length critical exponent ν_{j} was measured, being ν_{j}≈3/2. However, the obtained results for the percolation threshold θ_{p,k} showed that θ_{p,k} is an increasing function of k in the range 2≤k≤16. For k≥17, all jammed configurations are nonpercolating states, and consequently, the percolation phase transition disappears. The interplay between the percolation and the jamming effects is responsible for the existence of a maximum value of k (in this case, k=16) from which the percolation phase transition no longer occurs. Finally, a complete analysis of critical exponents and universality has been done, showing that the percolation phase transition involved in the system has the same universality class as the 3D random percolation, regardless of the size k considered.