In this paper, the percolation of mixtures of monomers and polyatomic species (k-mers) on a square lattice is studied. By means of a finite-size scaling analysis, the critical exponents and the scaling collapsing of the fraction of percolating lattices are found. A phase diagram separating a...

A prey–predator system with intelligent pursuit and evasion is studied by means of computer simulations. It is found that the model exhibits a coexistence state between prey and predators. In this state and depending on the parameters, the system may evolve toward two different regimes,...

Based on a recently developed algorithm for the exploration of ground states in bond-diluted lattice spin glasses, we determine the scaling of defect energies with system size for Ising spin glasses at the bond percolation threshold pc. The results can be related by well-known scaling relations...

Two-dimensional lattices of points are connected with long-range links, whose lengths are distributed according to P(r)∼r-α. By changing the decay exponent α one can go from d-dimensional short-range networks to ∞-dimensional networks topologically similar to random graphs. Percolation on...

A generalization of the pure site and pure bond percolation problems called site–bond percolation on a triangular lattice is studied. Motivated by considerations of cluster connectivity, two distinct schemes (denoted as S∩B and S∪B) for site–bond percolation are used. In S∩B (S∪B),...

Random Threshold Networks with sparse, asymmetric connections show complex dynamical behavior similar to Random Boolean Networks, with a transition from ordered to chaotic dynamics at a critical average connectivity Kc. In this type of model—contrary to Boolean Networks—propagation of local...