Percolation in two-dimensional lattices. I. A technique for the estimation of thresholds

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.

Optimal mechanical interactions direct multicellular network formation on elastic substrates

Cells self-organize into functional, ordered structures during tissue morphogenesis, a process that is evocative of colloidal self-assembly into engineered soft materials. Understanding how intercellular mechanical interactions may drive the formation of ordered and functional multicellular structures is important in developmental biology and tissue engineering. Here, by combining an agent-based model for contractile cells on elastic substrates with endothelial cell culture experiments, we show that substrate deformation-mediated mechanical interactions between cells can cluster and align them into branched networks. Motivated by the structure and function of vasculogenic networks, we predict how measures of network connectivity like percolation probability and fractal dimension as well as local morphological features including junctions, branches, and rings depend on cell contractility and density and on substrate elastic properties including stiffness and compressibility. We predict and confirm with experiments that cell network formation is substrate stiffness dependent, being optimal at intermediate stiffness. We also show the agreement between experimental data and predicted cell cluster types by mapping a combined phase diagram in cell density substrate stiffness. Overall, we show that long-range, mechanical interactions provide an optimal and general strategy for multicellular self-organization, leading to more robust and efficient realizations of space-spanning networks than through just local intercellular interactions.

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.

Adsorption of Metals on (100) Metallic Surfaces: Monte Carlo Simulations and Geometrical Phase Transitions

Adsorption and continuous phase transitions (percolation) of metals on (100) metallic surfaces are studied by means of Monte Carlo simulations and the finite-size scaling theory. The studied systems are Ag/Au(100), Au/Ag(100), Ag/Pt(100), and Pt/Ag(100), and the embedded atom method (EAM) is employed for energy calculations. Pairwise interactions are also considered for comparative purposes. The study of critical exponents reveals that these systems belong to the same universality as random sequential adsorption (RSA). For the four systems studied, and the two kinds of interactions considered, phase diagrams of percolation threshold, θ_c, as a function of temperature are presented. In all cases, and for all temperatures, θ_c is always below the value corresponding to RSA, as expected for attractive interactions, and it tends to that value as T → ∞. At intermediate temperatures, a particular behavior is found for EAM interactions.

From one-way streets to percolation on random mixed graphs

In most studies, street networks are considered as undirected graphs while one-way streets and their effect on shortest paths are usually ignored. Here, we first study the empirical effect of one-way streets in about 140 cities in the world. Their presence induces a detour that persists over a wide range of distances and is characterized by a nonuniversal exponent. The effect of one-ways on the pattern of shortest paths is then twofold: they mitigate local traffic in certain areas but create bottlenecks elsewhere. This empirical study leads naturally to considering a mixed graph model of 2d regular lattices with both undirected links and a diluted variable fraction p of randomly directed links which mimics the presence of one-ways in a street network. We study the size of the strongly connected component (SCC) versus p and demonstrate the existence of a threshold p_{c} above which the SCC size is zero. We show numerically that this transition is nontrivial for lattices with degree less than 4 and provide some analytical argument. We compute numerically the critical exponents for this transition and confirm previous results showing that they define a new universality class different from both the directed and standard percolation. Finally, we show that the transition on real-world graphs can be understood with random perturbations of regular lattices. The impact of one-ways on the graph properties was already the subject of a few mathematical studies, and our results show that this problem has also interesting connections with percolation, a classical model in statistical physics.

Postprocessing techniques for gradient percolation predictions on the square lattice

In this work, we revisit the classic problem of site percolation on a regular square lattice. In particular, we investigate the effect of quantization bias errors on percolation threshold predictions for large probability gradients and propose a mitigation strategy. We demonstrate through extensive computational experiments that the assumption of a linear relationship between probability gradient and percolation threshold used in previous investigations is invalid. Moreover, we demonstrate that, due to skewness in the distribution of occupation probabilities visited the average does not converge monotonically to the true percolation threshold. We identify several alternative metrics which do exhibit monotonic (albeit not linear) convergence and document their observed convergence rates.

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.

Bond percolation on simple cubic lattices with extended neighborhoods

We study bond percolation on the simple cubic lattice with various combinations of first, second, third, and fourth nearest neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the bond thresholds. Correlations between percolation thresholds and lattice properties are discussed, and our results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number z quite accurately according to a power-law p_{c}∼z^{-a} with exponent a=1.111. However, for large z, the threshold must approach the Bethe lattice result p_{c}=1/(z-1). Fitting our data and data for additional nearest neighbors, we find p_{c}(z-1)=1+1.224z^{-1/2}.

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.

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.

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.

Rational design of two-dimensional covalent tilings using a C6-symmetric building block via on-surface Schiff base reaction

Three types of well-ordered covalent two-dimensional tilings including triangular, rhombille and semi-regular Archimedean tilings were successfully constructed via on-surface Schiff base reaction. Among them, the covalent organic framework (COF) constructed from a C6 symmetry monomer and C3 symmetry monomer is the first reported COF with kgd (rhombille tiling) topology.

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.

Site-bond percolation of heteronuclear dimers irreversibly deposited on square lattices

A generalization of the site-bond percolation problem was studied, in which pairs of neighboring sites (site dimers) and bonds are occupied irreversibly, randomly, and independently on homogeneous square surfaces. A dimer is composed of two segments and occupies two adjacent sites. Each segment can be either a conductive segment (segment type A) or a nonconductive segment (segment type B). Two types of dimers are considered, AA and AB, and the connectivity analysis is carried out by accounting only for the conductive segments (segments type A) in combination with bonds. For the combination of dimers and bonds, two different criteria were analyzed: the union or the intersection between the adsorbed percolating particles and the bonds. By means of numerical simulations and finite-size scaling analysis, the complete phase diagram separating a percolating from a non-percolating region was determined.

Cell division and death inhibit glassy behaviour of confluent tissues

We investigate the effects of cell division and apoptosis on collective dynamics in two-dimensional epithelial tissues. Our model includes three key ingredients observed across many epithelia, namely cell-cell adhesion, cell death and a cell division process that depends on the surrounding environment. We show a rich non-equilibrium phase diagram depending on the ratio of cell death to cell division and on the adhesion strength. For large apoptosis rates, cells die out and the tissue disintegrates. As the death rate decreases, however, we show, consecutively, the existence of a gas-like phase, a gel-like phase, and a dense confluent (tissue) phase. Most striking is the observation that the tissue is self-melting through its own internal activity, ruling out the existence of any glassy phase.

Universality class of site and bond percolation on multifractal scale-free planar stochastic lattice

In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL), which is a multifractal and whose dual is a scale-free network. The characteristic property of percolation is that it exhibits threshold phenomena as we find sudden or abrupt jump in spanning probability across p_{c} accompanied by the divergence of some other observable quantities, which is reminiscent of a continuous phase transition. Indeed, percolation is characterized by the critical behavior of percolation strength P(p)∼(p_{c}-p)^{β}, mean cluster size S∼(p_{c}-p)^{-γ}, and the system size L∼(p_{c}-p)^{-ν}, which are known as the equivalent counterpart of the order parameter, susceptibility, and correlation length, respectively. Moreover, the cluster size distribution function n_{s}(p_{c})∼s^{-τ} and the mass-length relation M∼L^{d_{f}} of the spanning cluster also provide useful characterization of the percolation process. We numerically obtain a value for p_{c} and for all the exponents such as β,ν,γ,τ, and d_{f}. We find that, except for p_{c}, all the exponents are exactly the same in both bond and site percolation despite the significant difference in the definition of cluster and other quantities. Our results suggest that the percolation on WPSL belongs to a new universality class, as its exponents do not share the same value as for all the existing planar lattices. Besides, like all other cases, its site and bond type belong to the same universality class.

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.

Quantum random walks on congested lattices and the effect of dephasing

We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled on lattices that contain static defects which reverse the walker’s direction. We implement a dephasing process after each step which allows us to smoothly interpolate between classical and quantum random walks as well as study the effect of dephasing on the quantum walk. Our key results show that a quantum walker escapes a finite boundary dramatically faster than a classical walker and that this advantage remains in the presence of heavily congested lattices.

Percolation on a multifractal scale-free planar stochastic lattice and its universality class

We investigate site percolation on a weighted planar stochastic lattice (WPSL), which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by a threshold value p(c) at which a transition occurs and by a set of critical exponents β, γ, ν which describe the critical behavior of the percolation probability P(p), mean cluster size S(p), and the correlation length ξ. Besides, the exponent τ characterizes the cluster size distribution function n(s)(p(c)) and the fractal dimension d(f) characterizes the spanning cluster. We numerically obtain the value of p(c) and of all the exponents. These results suggest that the percolation on WPSL belong to a separate universality class than on all other planar lattices.

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.

Backbone structure of the Edwards-Anderson spin-glass model

We study the ground-state spatial heterogeneities of the Edwards-Anderson spin-glass model with both bimodal and Gaussian bond distributions. We characterize these heterogeneities by using a general definition of bond rigidity, which allows us to classify the bonds of the system into two sets, the backbone and its complement, with very different properties. This generalizes to continuous distributions of bonds the well-known definition of a backbone for discrete bond distributions. By extensive numerical simulations we find that the topological structure of the backbone for a given lattice dimensionality is very similar for both discrete and continuous bond distributions. We then analyze how these heterogeneities influence the equilibrium properties at finite temperature and we discuss the possibility that a suitable backbone picture can be relevant to describe spin-glass phenomena.

Percolation of aligned rigid rods on two-dimensional square lattices

The percolation behavior of aligned rigid rods of length k (kmers) on two-dimensional square lattices has been studied by numerical simulations and finite-size scaling analysis. The kmers, containing k identical units (each one occupying a lattice site), were irreversibly deposited along one of the directions of the lattice. The process was monitored 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 1 to 14, show that (i) the percolation threshold exhibits a decreasing function when it is plotted as a function of the kmer size; (ii) for any value of k (k>1), the percolation threshold is higher for aligned rods than for rods isotropically deposited; (iii) the phase transition occurring in the system belongs to the standard random percolation universality class regardless of the value of k considered; and (iv) in the case of aligned kmers, the intersection points of the curves of R(L,k)(p) for different system sizes exhibit nonuniversal critical behavior, varying continuously with changes in the kmer size. This behavior is completely different to that observed for the isotropic case, where the crossing point of the curves of R(L,k)(p) do not modify their numerical value as k is increased.

A bona fide two-dimensional percolation model: an insight into the optimum photoactivator concentration in La2/3-x Eu x Ta2O7 nanosheets

La-Eu solid solution nanosheets La_2/3-x Eu _x Ta₂O₇ have been synthesized, and their photoluminescence properties have been investigated. La_2/3-x Eu _x Ta₂O₇ nanosheets were prepared from layered perovskite compounds Li₂La_2/3-x Eu _x Ta₂O₇ as the precursors by soft chemical exfoliation reactions. Both the precursors and the exfoliated nanosheets exhibit a decrease in intralayer lattice parameters as the Eu contents increase. However, there is a discontinuity in this trend between the nominal Eu content ranges x≤ 0.3 and x ≥ 0.4. This discontinuity is attributed to the difference in degree of TaO₆ octahedra tilting for the La- and Eu-rich phases. La_2/3-x Eu _x Ta₂O₇ nanosheets exhibit red emission, characteristic of the f-f transitions in Eu³⁺ photoactivators. The photoluminescence emission can be obtained from both host and direct photoactivator excitation. However, photoluminescence emission through host excitation is much more dominant than that through direct photoactivator excitation, and this behavior is consistent with that of all the other rare-earth photoactivated nanosheets reported previously. The absolute photoluminescence quantum efficiency of the La_2/3-x Eu _x Ta₂O₇ nanosheets increases as the experimentally determined Eu contents increase up to x=0.45 and decrease above it. This result is in good agreement with the optimum photoactivator concentration expected from the percolation theory. These solid solution La_2/3-x Eu _x Ta₂O₇ nanosheets are excellent models for validating the theory of optimum photoactivator concentration in the truly two-dimensional photoactivator matrix.

Pseudo-random-number generators and the square site percolation threshold

Selected pseudo-random-number generators are applied to a Monte Carlo study of the two-dimensional square-lattice site percolation model. A generator suitable for high precision calculations is identified from an application specific test of randomness. After extended computation and analysis, an ostensibly reliable value of p_{c}=0.59274598(4) is obtained for the percolation threshold.

Impact of composition of extended objects on percolation on a lattice

We consider the percolation aspect of random sequential adsorption of extended particles onto a two-dimensional lattice using computer Monte Carlo simulations. We investigate how the composition of the particles influences the value of the percolation threshold. Two regimes can be distinguished: one for almost linear particles (with the composition of straight segments reaching 85-100 %) and the second one for more bent (flexible) ones. For more bent particles we found a high correlation between the percolation threshold and the structure of an adsorbate at percolation. We also observe that there is no difference in the conclusions for both kinds of lattice considered (square and triangular).

Rigorous confidence intervals for critical probabilities

We use the method of Balister, Bollobás, and Walters [Random Struct. Algorithms 26, 392 (2005)] to give rigorous 99.9999% confidence intervals for the critical probabilities for site and bond percolation on the 11 Archimedean lattices. In our computer calculations, the emphasis is on simplicity and ease of verification, rather than obtaining the best possible results. Nevertheless, we obtain intervals of width at most 0.0005 in all cases.

Percolation of polyatomic species with the presence of impurities

In this paper, the percolation of (a) linear segments of size k and (b) k-mers of different structures and forms deposited on a square lattice contaminated with previously adsorbed impurities have been studied. The contaminated or diluted lattice is built by randomly selecting a fraction of the elements of the lattice (either bonds or sites) which are considered forbidden for deposition. Results are obtained by extensive use of finite size scaling theory. Thus, in order to test the universality of the phase transition occurring in the system, the numerical values of the critical exponents were determined. The characteristic parameters of the percolation problem are dependent not only on the form and structure of the k-mers but also on the properties of the lattice where they are deposited. A phase diagram separating a percolating from a nonpercolating region is determined as a function of the parameters of the problem. A comparison between random site and random bond percolation in the presence of impurities on the lattice is presented.

Surface order-disorder phase transitions and percolation

In the present paper, the connection between surface order-disorder phase transitions and the percolating properties of the adsorbed phase has been studied. For this purpose, four lattice-gas models in the presence of repulsive interactions have been considered. Namely, monomers on honeycomb, square, and triangular lattices, and dimers (particles occupying two adjacent adsorption sites) on square substrates. By using Monte Carlo simulation and finite-size scaling analysis, we obtain the percolation threshold theta(c) of the adlayer, which presents an interesting dependence with w/k(B)T (w, k(B), and T being the lateral interaction energy, the Boltzmann constant, and the temperature, respectively). For each geometry and adsorbate size, a phase diagram separating a percolating and a nonpercolating region is determined.

Site-bond percolation of polyatomic species

A generalization of the classical monomer site-bond percolation problem is studied in which linear k-uples of nearest neighbor sites (site k-mers) and linear k-uples of nearest neighbor bonds (bond k-mers) are independently occupied at random on a square lattice. We called this model the site-bond percolation of polyatomic species or k-mer site-bond percolation. Motivated by considerations of cluster connectivity, we have used two distinct schemes (denoted as S intersection of B and S union of B) for k-mer site-bond percolation. In S intersection of B(S union of B), two points are said to be connected if a sequence of occupied sites and (or) bonds joins them. By using Monte Carlo simulations and finite-size scaling theory, data from S intersection of B and S union of B are analyzed in order to determine the critical curves separating the percolating and nonpercolating regions.

Convergence of threshold estimates for two-dimensional percolation

Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system with a square boundary, specifically for site percolation on a square lattice. We show that the convergence of the average-probability estimate is described by a nontrivial correction-to-scaling exponent as predicted previously, and measure the value of this exponent to be 0.90+/-0.02. For the median and cell-to-cell estimates of the percolation threshold we verify that convergence does not depend on this exponent, having instead a slightly faster convergence with a trivial analytic leading exponent.

Percolation thresholds, critical exponents, and scaling functions on planar random lattices and their duals

The bond-percolation process is studied on periodic planar random lattices and their duals. The thresholds and critical exponents of the percolation transition are determined. The scaling functions of the percolating probability, the existence probability of the appearance of percolating clusters, and the mean cluster size are also calculated. The simulation result of the percolation threshold is p(c)=0.3333+/-0.0001 for planar random lattices, and 0.6670+/-0.0001 for the duals of planar random lattices. We conjecture that the exact value of p(c) is 1/3 for a planar random lattice and 2/3 for the dual of a planar random lattice. By taking possible errors into account, the results of our critical exponents agree with the values given by the universality hypothesis. By properly adjusting the metric factors on random lattices and their duals, we demonstrate explicitly that the idea of a universal scaling function with nonuniversal metric factors in the finite-size scaling theory can be extended to random lattices and their duals for the existence probability, the percolating probability, and the mean cluster size.

Site percolation thresholds for Archimedean lattices

Precise thresholds for site percolation on eight Archimedean lattices are determined by the hull-walk gradient-percolation simulation method, with the results p(c)=0.697 043, honeycomb or (6(3)), 0.807 904 (3,12(2)), 0.747 806 (4,6,12), 0.729 724 (4,8(2)), 0.579 498 (3(4),6), 0.621 819 (3,4,6,4), 0.550 213 (3(3),4(2)), and 0.550 806 (3(2),4,3,4), with errors of about +/- 3 x 10(-6). [The remaining Archimedean lattices are the square (4(4)), triangular (3(6)), and Kagomé (3,6,3,6), for which p(c) is already known exactly or to a high degree of accuracy.] The numerical result for the (3,12(2)) lattice is consistent with the exact value [1-2 sin(pi/18)](1/2). The values of p(c) for all 11 Archimedean lattices, as well as a number of nonuniform lattices, are found to be well correlated by a nearly linear function of a generalized Scher-Zallen filling factor. This correlation is much more accurate than recently proposed correlations based solely upon coordination number.

Lateral diffusion in an archipelago. Dependence on tracer size

In a pure fluid-phase lipid, the dependence of the lateral diffusion coefficient on the size of the diffusing particle may be obtained from the Saffman-Delbrück equation or the free-volume model. When diffusion is obstructed by immobile proteins or domains of gel-phase lipids, the obstacles yield an additional contribution to the size dependence. Here this contribution is examined using Monte Carlo calculations. For random point and hexagonal obstacles, the diffusion coefficient depends strongly on the size of the diffusing particle, but for fractal obstacles--cluster-cluster aggregates and multicenter diffusion-limited aggregates--the diffusion coefficient is independent of the size of the diffusing particle. The reason is that fractals have no characteristic length scale, so a tracer sees on average the same obstructions, regardless of its size. The fractal geometry of the excluded area for tracers of various sizes is examined. Percolation thresholds are evaluated for a variety of obstacles to determine how the threshold depends on tracer size and to compare the thresholds for compact and extended obstacles.