Percolation of linear k-mers on a square lattice: from isotropic through partially ordered to completely aligned states

Percolation and jamming in random sequential adsorption of straight k-mers on square, triangular, and cubic lattices

Random sequential adsorption (RSA) is one of the most widely used theoretical models of macromolecule and particle adsorption. Here we consider jammed (saturated) states of the RSA process of aligned, nonoverlapping k-mers (linear objects occupying k consecutive lattice sites) in square, triangular, and cubic lattices and show that each k-mer in such a state belongs to a percolating cluster. We also discuss several generalizations of our approach, including a hypercubic lattice and models with several different k-mer lengths.

Effect of shape anisotropy on percolation of aligned and overlapping objects on lattices

We investigate the percolation transition of aligned, overlapping, anisotropic shapes on lattices. Using the recently proposed lattice version of excluded volume theory, we show that shape-anisotropy leads to some intriguing consequences regarding the percolation behavior of anisotropic shapes. We consider a prototypical anisotropic shape-rectangle-on a square lattice and show that, for rectangles of width unity (sticks), the percolation threshold is a monotonically decreasing function of the stick length, whereas, for rectangles of width greater than two, it is a monotonically increasing function. Interestingly, for rectangles of width two, the percolation threshold is independent of its length. We show that this independence of threshold on the length of a side holds for d-dimensional hypercubiods as well as for specific integer values for the lengths of the remaining sides. The limiting case of the length of the rectangles going to infinity shows that the limiting threshold value is finite and depends upon the width of the rectangle. This "continuum" limit with the lattice spacing tending to zero only along a subset of the possible directions in d dimensions results in a "semicontinuum" percolation system. We show that similar results hold for other anisotropic shapes and lattices in different dimensions. The critical properties of the aligned and overlapping rectangles are evaluated using Monte Carlo simulations. We find that the threshold values given by the lattice-excluded volume theory are in good agreement with the simulation results, especially for larger rectangles. We verify the isotropy of the percolation threshold and also compare our results with models where rectangles of mixed orientation are allowed. Our simulation results show that alignment increases the percolation threshold. The calculation of critical exponents places the model in the standard percolation universality class. Our results show that shape anisotropy of the aligned, overlapping percolating units has a marked influence on the percolation properties, especially when a subset of the dimensions of the percolation units is made to diverge.

Percolation of straight slots on a square grid

This work is devoted to the emergence of a connected network of slots (cracks) on a square grid. Accordingly, extensive Monte Carlo simulations and finite-size scaling analysis have been conducted to study the site percolation of straight slots with length l measured in the number of elementary cells of the grid with the edge size L. A special focus was made on the dependence of the percolation threshold p_{C}(l,L) on the slot length l varying in the range 1≤l≤L-2 for the square grids with edge size in the range 50≤L≤1000. In this way, we found that p_{C}(l,L) strongly decreases with increase of l, whereas the variations of p_{C}(l=const,L) with the variation of ratio l/L are very small. Consequently, we acquire the functional dependencies of the critical filling factor and percolation strength on the slot length. Furthermore, we established that the slot percolation model interpolates between the site percolation on square lattice (l=1) and the continuous percolation of widthless sticks (l→∞) aligned in two orthogonal directions. In this regard, we note that the critical number of widthless sticks per unit area is larger than in the case of randomly oriented sticks. Our estimates for the critical exponents indicate that the slot percolation belongs to the same universality class as standard Bernoulli percolation.

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.

Universal Critical Behavior of Percolation in Orientationally Ordered Janus Particles and Other Anisotropic Systems

We combine percolation theory and Monte Carlo simulation to study in two dimensions the connectivity of an equilibrium lattice model of interacting Janus disks which self-assemble into an orientationally ordered stripe phase at low temperature. As the patch size is increased or the temperature is lowered, clusters of patch-connected disks grow, and a percolating cluster emerges at a threshold. In the stripe phase, the critical clusters extend longer in the direction parallel to the stripes than in the perpendicular direction, and percolation is thus anisotropic. It is found that the critical behavior of percolation in the Janus system is consistent with that of standard isotropic percolation, when an appropriate spatial rescaling is made. The rescaling procedure can be applied to understand other anisotropic systems, such as the percolation of aligned rigid rods and of the q-state Potts model with anisotropic interactions.

Random adsorption process of linear k-mers on square lattices under the Achlioptas process

We study the explosive percolation with k-mer random sequential adsorption (RSA) process. We consider both the Achlioptas process (AP) and the inverse Achlioptas process (IAP), in which giant cluster formation is prohibited and accelerated, respectively. By employing finite-size scaling analysis, we confirm that the percolation transitions are continuous, and thus we calculate the percolation threshold and critical exponents. This allows us to determine the universality class of the k-mer explosive percolation transition. Interestingly, the numerical simulation suggests that the universality class of the explosive percolation transition with the AP alters when the k-mer size changes. In contrast, the universality class of the transition with the IAP is independent of k, but it differs from that of the RSA without the IAP.

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.

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.

Connectedness percolation in the random sequential adsorption packings of elongated particles

Connectedness percolation phenomena in the two-dimensional packing of elongated particles (discorectangles) were studied numerically. The packings were produced using random sequential adsorption off-lattice models with preferential orientations of the particles along a given direction. The partial ordering was characterized by the order parameter S, with S=0 for completely disordered films (random orientation of particles) and S=1 for completely aligned particles along the horizontal direction x. The aspect ratio (length-to-width ratio) of the particles was varied within the range ɛ∈[1;100]. Analysis of connectivity was performed assuming a core-shell structure of the particles. The value of S affected the structure of the packings, the formation of long-range connectivity, and the behavior of the electrical conductivity. The effects can be explained by taking accounting of the competition between the particles' orientational degrees of freedom and excluded volume effects. For aligned deposition, anisotropy in the electrical conductivity was observed with the values along the alignment direction σ_{x} being larger than the values in the perpendicular direction σ_{y}. Anisotropy in the localization of the percolation threshold was also observed in finite-sized packings, but it disappeared in the limit of infinitely large systems.

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.

Percolation of aligned rigid rods on two-dimensional triangular lattices

The percolation behavior of aligned rigid rods of length k (k-mers) on two-dimensional triangular lattices has been studied by numerical simulations and finite-size scaling analysis. The k-mers, containing k identical units (each one occupying a lattice site), were irreversibly deposited along one of the directions of the lattice. The connectivity analysis was carried out by following the probability R_{L,k}(p) that a lattice composed of L×L sites percolates at a concentration p of sites occupied by particles of size k. The results, obtained for k ranging from 2 to 80, showed that the percolation threshold p_{c}(k) exhibits a increasing function when it is plotted as a function of the k-mer size. The dependence of p_{c}(k) was determined, being p_{c}(k)=A+B/(C+sqrt[k]), where A=p_{c}(k→∞)=0.582(9) is the value of the percolation threshold by infinitely long k-mers, B=-0.47(0.21), and C=5.79(2.18). This behavior is completely different from that observed for square lattices, where the percolation threshold decreases with k. In addition, the effect of the anisotropy on the properties of the percolating phase was investigated. The results revealed that, while for finite systems the anisotropy of the deposited layer favors the percolation along the parallel direction to the alignment axis, in the thermodynamic limit, the value of the percolation threshold is the same in both parallel and transversal directions. Finally, an exhaustive study of critical exponents and universality was carried out, showing that the phase transition occurring in the system belongs to the standard random percolation universality class regardless of the value of k considered.

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.

Tensor renormalization group study of hard-disk models on a triangular lattice

High accuracy and performance of the tensor renormalization group (TRG) method have been demonstrated for the model of hard disks on a triangular lattice. We considered a sequence of models with disk diameter ranging from a to 2sqrt[3]a, where a is the lattice constant. Practically, these models are good for approximate description of thermodynamics properties of molecular layers on crystal surfaces. Theoretically, it is interesting to analyze if and how this sequence converges to the continuous model of hard disks. The dependencies of the density and heat capacity on the chemical potential were calculated with TRG and transfer-matrix (TM) methods. We benchmarked accuracy and performance of the TRG method comparing it with TM method and with exact result for the model with nearest-neighbor exclusions (1NN). The TRG method demonstrates good convergence and turns out to be superior over TM with regard to considered models. Critical values of chemical potential (μ_{c}) have been computed for all models. For the model with next-nearest-neighbor exclusions (2NN) the TRG and TM produce consistent results (μ_{c}=1.75587 and μ_{c}=1.75398 correspondingly) that are also close to earlier Monte Carlo estimation by Zhang and Deng. We found that 3NN and 5NN models shows the first-order phase transition, with close values of μ_{c} (μ_{c}=4.4488 for 3NN and 4.4<μ_{c}<4.5 for 5NN). The 4NN model demonstrates continuous yet rapid phase transition with 2.65<μ_{c}<2.7.

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

Percolation and jamming of k×k square tiles (k^{2}-mers) deposited on square lattices have been studied by numerical simulations complemented with finite-size scaling theory and exact enumeration of configurations for small systems. The k^{2}-mers were irreversibly deposited into square lattices of sizes L×L with L/k ranging between 128 and 448 (64 and 224) for jamming (percolation) calculations. Jamming coverage θ_{j,k} was determined for a wide range of k values (2≤k≤100 with many intermediate k values to allow a fine scaling analysis). θ_{j,k} exhibits a decreasing behavior with increasing k, being θ_{j,k=∞}=0.5623(3) the limit value for large k^{2}-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}≈1. On the other hand, the obtained results for the percolation threshold θ_{c,k} showed that θ_{c,k} is an increasing function of k in the range 1≤k≤3. For k≥4, all jammed configurations are nonpercolating states and, consequently, the percolation phase transition disappears. An explanation for this phenomenon is offered in terms of the rapid increase with k of the number of surrounding occupied sites needed to reach percolation, which gets larger than the sufficient number of occupied sites to define jamming. In the case of k=2 and 3, the percolation thresholds are θ_{c,k=2}(∞)=0.60355(8) and θ_{c,k=3}=0.63110(9). Our results significantly improve the previously reported values of θ_{c,k=2}^{Naka}=0.601(7) and θ_{c,k=3}^{Naka}=0.621(6) [Nakamura, Phys. Rev. A 36, 2384 (1987)0556-279110.1103/PhysRevA.36.2384]. In parallel, a comparison with previous results for jamming on these systems is also done. 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 ordinary random percolation, regardless of the size k considered.

Anisotropy in electrical conductivity of two-dimensional films containing aligned nonintersecting rodlike particles: Continuous and lattice models

The electrical conductivity of two-dimensional films filled with rodlike particles (rods) was simulated by the Monte Carlo method. The main attention has been paid to the investigation of the effect of the rod alignment on the electrical properties of the films. Both continuous and lattice approaches were used. Intersections of particles were forbidden. Our main findings are (i) both models demonstrate similar behaviors, (ii) at low concentration of rods, both approaches lead to the same dependencies of the electrical conductivity on the concentration of the rods, (iii) the alignment of the rods essentially affects the electrical conductivity, (iv) at some concentrations of partially aligned rods, the films may be conducting only in one direction, and (v) the films may simultaneously be both highly transparent and electrically anisotropic.

Standard and inverse bond percolation of straight rigid rods on square lattices

Numerical simulations and finite-size scaling analysis have been carried out to study standard and inverse bond percolation of straight rigid rods on square lattices. In the case of standard percolation, the lattice is initially empty. Then, linear bond k-mers (sets of k linear nearest-neighbor bonds) are randomly and sequentially deposited on the lattice. Jamming coverage p_{j,k} and percolation threshold p_{c,k} are determined for a wide range of k (1≤k≤120). p_{j,k} and p_{c,k} exhibit a decreasing behavior with increasing k, p_{j,k→∞}=0.7476(1) and p_{c,k→∞}=0.0033(9) being the limit values for large k-mer sizes. p_{j,k} is always greater than p_{c,k}, and consequently, the percolation phase transition occurs for all values of k. In the case of inverse percolation, the process starts with an initial configuration where all lattice bonds are occupied and, given that periodic boundary conditions are used, the opposite sides of the lattice are connected by nearest-neighbor occupied bonds. Then, the system is diluted by randomly removing linear bond k-mers from the lattice. The central idea here is based on finding the maximum concentration of occupied bonds (minimum concentration of empty bonds) for which connectivity disappears. This particular value of concentration is called the inverse percolation threshold p_{c,k}^{i}, and determines a geometrical phase transition in the system. On the other hand, the inverse jamming coverage p_{j,k}^{i} is the coverage of the limit state, in which no more objects can be removed from the lattice due to the absence of linear clusters of nearest-neighbor bonds of appropriate size. It is easy to understand that p_{j,k}^{i}=1-p_{j,k}. The obtained results for p_{c,k}^{i} show that the inverse percolation threshold is a decreasing function of k in the range 1≤k≤18. For k>18, 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 bonds p_{j,k}^{i} is reached. In terms of network attacks, this striking behavior indicates that random attacks on single nodes (k=1) are much more effective than correlated attacks on groups of close nodes (large k's). Finally, the accurate determination of critical exponents reveals that standard and inverse bond percolation models on square lattices belong to the same universality class as the random percolation, regardless of the size k considered.

Diffusion dynamics and steady states of systems of hard rods on a square lattice

It is known from grand canonical simulations of a system of hard rods on two-dimensional lattices that an orientationally ordered nematic phase exists only when the length of the rods is at least seven. However, a recent microcanonical simulation with diffusion kinetics, conserving both total density and zero nematic order, reported the existence of a nematically phase-segregated steady state with interfaces in the diagonal direction for rods of length six [Phys. Rev. E 95, 052130 (2017)2470-004510.1103/PhysRevE.95.052130], violating the equivalence of different ensembles for systems in equilibrium. We resolve this inconsistency by demonstrating that the kinetics violate detailed balance condition and drives the system to a nonequilibrium steady state. By implementing diffusion kinetics that drive the system to equilibrium, even within this constrained ensemble, we recover earlier results showing phase segregation only for rods of length greater than or equal to seven. Furthermore, in contrast to the nonequilibrium steady state, the interface has no preferred orientational direction. In addition, by implementing different nonequilibrium kinetics, we show that the interface between the phase segregated states can lie in different directions depending on the choice of kinetics.

Jammed systems of oriented needles always percolate on square lattices

Random sequential adsorption (RSA) is a standard method of modeling adsorption of large molecules at the liquid-solid interface. Several studies have recently conjectured that in the RSA of rectangular needles, or k-mers, on a square lattice, percolation is impossible if the needles are sufficiently long (k of order of several thousand). We refute these claims and present rigorous proof that in any jammed configuration of nonoverlapping, fixed-length, horizontal, or vertical needles on a square lattice, all clusters are percolating clusters.

Diffusion-driven self-assembly of rodlike particles: Monte Carlo simulation on a square lattice

The diffusion-driven self-assembly of rodlike particles was studied by means of Monte Carlo simulation. The rods were represented as linear k-mers (i.e., particles occupying k adjacent sites). In the initial state, they were deposited onto a two-dimensional square lattice of size L×L up to the jamming concentration using a random sequential adsorption algorithm. The size of the lattice, L, was varied from 128 to 2048, and periodic boundary conditions were applied along both x and y axes, while the length of the k-mers (determining the aspect ratio) was varied from 2 to 12. The k-mers oriented along the x and y directions (k_{x}-mers and k_{y}-mers, respectively) were deposited equiprobably. In the course of the simulation, the numbers of intraspecific and interspecific contacts between the same sort and between different sorts of k-mers, respectively, were calculated. Both the shift ratio of the actual number of shifts along the longitudinal or transverse axes of the k-mers and the electrical conductivity of the system were also examined. For the initial random configuration, quite different self-organization behavior was observed for short and long k-mers. For long k-mers (k≥6), three main stages of diffusion-driven spatial segregation (self-assembly) were identified: the initial stage, reflecting destruction of the jamming state; the intermediate stage, reflecting continuous cluster coarsening and labyrinth pattern formation; and the final stage, reflecting the formation of diagonal stripe domains. Additional examination of two artificially constructed initial configurations showed that this pattern of diagonal stripe domains is an attractor, i.e., any spatial distribution of k-mers tends to transform into diagonal stripes. Nevertheless, the time for relaxation to the steady state essentially increases as the lattice size growth.

Monte Carlo simulation of evaporation-driven self-assembly in suspensions of colloidal rods

The vertical drying of a colloidal film containing rodlike particles was studied by means of kinetic Monte Carlo (MC) simulation. The problem was approached using a two-dimensional square lattice, and the rods were represented as linear k-mers (i.e., particles occupying k adjacent sites). The initial state before drying was produced using a model of random sequential adsorption (RSA) with isotropic orientations of the k-mers (orientation of the k-mers along horizontal x and vertical y directions are equiprobable). In the RSA model, overlapping of the k-mers is forbidden. During the evaporation, an upper interface falls with a linear velocity of u in the vertical direction and the k-mers undergo translation Brownian motion. The MC simulations were run at different initial concentrations, p_{i}, (p_{i}∈[0,p_{j}], where p_{j} is the jamming concentration), lengths of k-mers (k∈[1,12]), and solvent evaporation rates, u. For completely dried films, the spatial distributions of k-mers and their electrical conductivities in both x and y directions were examined. Significant evaporation-driven self-assembly and orientation stratification of the k-mers oriented along the x and y directions were observed. The extent of stratification increased with increasing value of k. The anisotropy of the electrical conductivity of the film can be finely regulated by changes in the values of p_{i}, k, and u.

Electrical conductivity of a monolayer produced by random sequential adsorption of linear k-mers onto a square lattice

The electrical conductivity of a monolayer produced by the random sequential adsorption (RSA) of linear k-mers (particles occupying k adjacent adsorption sites) onto a square lattice was studied by means of computer simulation. Overlapping with predeposited k-mers and detachment from the surface were forbidden. The RSA process continued until the saturation jamming limit, p_{j}. The isotropic (equiprobable orientations of k-mers along x and y axes) and anisotropic (all k-mers aligned along the y axis) depositions for two different models-of an insulating substrate and conducting k-mers (C model) and of a conducting substrate and insulating k-mers (I model)-were examined. The Frank-Lobb algorithm was applied to calculate the electrical conductivity in both the x and y directions for different lengths (k=1 - 128) and concentrations (p=0 - p_{j}) of the k-mers. The "intrinsic electrical conductivity" and concentration dependence of the relative electrical conductivity Σ(p) (Σ=σ/σ_{m} for the C model and Σ=σ_{m}/σ for the I model, where σ_{m} is the electrical conductivity of substrate) in different directions were analyzed. At large values of k the Σ(p) curves became very similar and they almost coincided at k=128. Moreover, for both models the greater the length of the k-mers the smoother the functions Σ_{xy}(p),Σ_{x}(p) and Σ_{y}(p). For the more practically important C model, the other interesting findings are (i) for large values of k (k=64,128), the values of Σ_{xy} and Σ_{y} increase rapidly with the initial increase of p from 0 to 0.1; (ii) for k≥16, all the Σ_{xy}(p) and Σ_{x}(p) curves intersect with each other at the same isoconductivity points; (iii) for anisotropic deposition, the percolation concentrations are the same in the x and y directions, whereas, at the percolation point the greater the length of the k-mers the larger the anisotropy of the electrical conductivity, i.e., the ratio σ_{y}/σ_{x} (>1).

Percolation of heteronuclear dimers irreversibly deposited on square lattices

The percolation problem of irreversibly deposited heteronuclear dimers on square lattices is studied. A dimer is composed of two segments, and it occupies two adjacent adsorption sites. Each segment can be either a conductive segment (segment type A) or a nonconductive segment (segment type B). Three types of dimers are considered: AA, BB, and AB. The connectivity analysis is carried out by accounting only for the conductive segments (segments type A). The model offers a simplified representation of the problem of percolation of defective (nonideal) particles, where the presence of defects in the system is simulated by introducing a mixture of conductive and nonconductive segments. Different cases were investigated, according to the sequence of deposition of the particles, the types of dimers involved in the process, and the degree of alignment of the deposited objects. By means of numerical simulations and finite-size scaling analysis, the complete phase diagram separating a percolating from a nonpercolating region was determined for each case. Finally, the consistency of our results was examined by comparing with previous data in the literature for linear k-mers (particles occupying k adjacent sites) with defects.

Percolation and jamming of linear k-mers on a square lattice with defects: Effect of anisotropy

Using the Monte Carlo simulation, we study the percolation and jamming of oriented linear k-mers on a square lattice that contains defects. The point defects with a concentration d are placed randomly and uniformly on the substrate before deposition of the k-mers. The general case of unequal probabilities for orientation of depositing of k-mers along different directions of the lattice is analyzed. Two different relaxation models of deposition that preserve the predetermined order parameter s are used. In the relaxation random sequential adsorption (RRSA) model, the deposition of k-mers is distributed over different sites on the substrate. In the single-cluster relaxation (RSC) model, the single cluster grows by the random accumulation of k-mers on the boundary of the cluster (Eden-like model). For both models, a suppression of growth of the infinite (percolation) cluster at some critical concentration of defects d(c) is observed. In the zero-defect lattices, the jamming concentration p(j) (RRSA model) and the density of single clusters p(s) (RSC model) decrease with increasing length k-mers and with a decrease in the order parameter. For the RRSA model, the value of d(c) decreases for short k-mers (k<16) as the value of s increases. For k=16 and 32, the value of d(c) is almost independent of s. Moreover, for short k-mers, the percolation threshold is almost insensitive to the defect concentration for all values of s. For the RSC model, the growth of clusters with ellipselike shapes is observed for nonzero values of s. The density of the clusters p(s) at the critical concentration of defects d(c) depends in a complex manner on the values of s and k. An interesting finding for disordered systems (s=0) is that the value of p(s) tends towards zero in the limits of the very long k-mers, k→∞, and very small critical concentrations d(c)→0. In this case, the introduction of defects results in a suppression of k-mer stacking and in the formation of empty or loose clusters with very low density. On the other hand, denser clusters are formed for ordered systems with p(s)≈0.065 at s=0.5 and p(s)≈0.38 at s=1.0.

Jamming and percolation in generalized models of random sequential adsorption of linear k-mers on a square lattice

The jamming and percolation for two generalized models of random sequential adsorption (RSA) of linear k-mers (particles occupying k adjacent sites) on a square lattice are studied by means of Monte Carlo simulation. The classical RSA model assumes the absence of overlapping of the new incoming particle with the previously deposited ones. The first model is a generalized variant of the RSA model for both k-mers and a lattice with defects. Some of the occupying k adjacent sites are considered as insulating and some of the lattice sites are occupied by defects (impurities). For this model even a small concentration of defects can inhibit percolation for relatively long k-mers. The second model is the cooperative sequential adsorption one where, for each new k-mer, only a restricted number of lateral contacts z with previously deposited k-mers is allowed. Deposition occurs in the case when z≤(1-d)z(m) where z(m)=2(k+1) is the maximum numbers of the contacts of k-mer, and d is the fraction of forbidden contacts. Percolation is observed only at some interval k(min)≤k≤k(max) where the values k(min) and k(max) depend upon the fraction of forbidden contacts d. The value k(max) decreases as d increases. A logarithmic dependence of the type log(10)(k(max))=a+bd, where a=4.04±0.22,b=-4.93±0.57, is obtained.

Dimer covering and percolation frustration

Covering a graph or a lattice with nonoverlapping dimers is a problem that has received considerable interest in areas, such as discrete mathematics, statistical physics, chemistry, and materials science. Yet, the problem of percolation on dimer-covered lattices has received little attention. In particular, percolation on lattices that are fully covered by nonoverlapping dimers has not evidently been considered. Here, we propose a procedure for generating random dimer coverings of a given lattice. We then compute the bond percolation threshold on random and ordered coverings of the square and the triangular lattices on the remaining bonds connecting the dimers. We obtain p_{c}=0.367713(2) and p_{c}=0.235340(1) for random coverings of the square and the triangular lattices, respectively. We observe that the percolation frustration induced as a result of dimer covering is larger in the low-coordination-number square lattice. There is also no relationship between the existence of long-range order in a covering of the square lattice and its percolation threshold. In particular, an ordered covering of the square lattice, denoted by shifted covering in this paper, has an unusually low percolation threshold and is topologically identical to the triangular lattice. This is in contrast to the other ordered dimer coverings considered in this paper, which have higher percolation thresholds than the random covering. In the case of the triangular lattice, the percolation thresholds of the ordered and random coverings are very close, suggesting the lack of sensitivity of the percolation threshold to microscopic details of the covering in highly coordinated networks.

Site trimer percolation on square lattices

Percolation of site trimers (k-mers with k=3) is investigated in a detailed way making use of an analytical model based on renormalization techniques in this problem. Results are compared to those obtained here by means of extensive computer simulations. Five different deposition possibilities for site trimers are included according to shape and orientation of the depositing objects. Analytical results for the percolation threshold p(c) are all close to 0.55, while numerical results show a slight dispersion around this value. A comparison with p(c) values previously reported for monomers and dimers establishes the tendency of p(c) to decrease as k increases. Critical exponent ν was also obtained both by analytical and numerical methods. Results for the latter give values very close to the expected value 4/3 showing that this percolation case corresponds to the universality class of random percolation.

The structure of adsorbed cyclic chains

In order to determine the structure of polymer films formed of cyclic chains (rings) we developed and studied a simple coarse-grained model. Our main goal was to check how the percolation and jamming thresholds in such a system were related to the thresholds obtained for linear flexible chains system, i.e., how the geometry of objects influenced both thresholds. All atomic details were suppressed and polymers were represented as a sequence of identical beads and the chains were embedded to a square lattice (a strictly 2D model). The system was athermal and the excluded volume was the only potential introduced. A random sequential adsorption algorithm was chosen to determine the properties of a polymer monolayer. It was shown that the percolation threshold of cyclic chains was considerably higher than those of linear flexible chains while the jamming thresholds for both chain architectures are very similar. The shape of adsorbed cyclic chains was found to be more prolate when compared to average single chain.

Impact of defects on percolation in random sequential adsorption of linear k-mers on square lattices

The effect of defects on the percolation of linear k-mers (particles occupying k adjacent sites) on a square lattice is studied by means of Monte Carlo simulation. The k-mers are deposited using a random sequential adsorption mechanism. Two models L(d) and K(d) are analyzed. In the L(d) model it is assumed that the initial square lattice is nonideal and some fraction of sites d is occupied by nonconducting point defects (impurities). In the K(d) model the initial square lattice is perfect. However, it is assumed that some fraction of the sites in the k-mers d consists of defects, i.e., is nonconducting. The length of the k-mers k varies from 2 to 256. Periodic boundary conditions are applied to the square lattice. The dependences of the percolation threshold concentration of the conducting sites p(c) vs the concentration of defects d are analyzed for different values of k. Above some critical concentration of defects d(m), percolation is blocked in both models, even at the jamming concentration of k-mers. For long k-mers, the values of d(m) are well fitted by the functions d(m)∝k(m)(-α)-k(-α) (α=1.28±0.01 and k(m)=5900±500) and d(m)∝log(10)(k(m)/k) (k(m)=4700±1000) for the L(d) and K(d) models, respectively. Thus, our estimation indicates that the percolation of k-mers on a square lattice is impossible even for a lattice without any defects if k⪆6×10(3).

Reentrant disordered phase in a system of repulsive rods on a Bethe-like lattice

We solve exactly a model of monodispersed rigid rods of length k with repulsive interactions on the random locally tree-like layered lattice. For k≥4 we show that with increasing density, the system undergoes two phase transitions: first, from a low-density disordered phase to an intermediate density nematic phase and, second, from the nematic phase to a high-density reentrant disordered phase. When the coordination number is four, both phase transitions are continuous and in the mean field Ising universality class. For an even coordination number larger than four, the first transition is discontinuous, while the nature of the second transition depends on the rod length k and the interaction parameters.