Comparison of rigidity and connectivity percolation in two dimensions

We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the augmented triangular lattice shows a continuous transition at a non-trivial p_c. On the augmented triangular lattice we find, by extensive numerical simulation, that the directed rigidity percolation transition belongs to the same universality c...

We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical simulations. Unlike its higher-dimensional counterparts, this problem has no sharp percolation threshold and the spanning (percolation) probability is a smooth function monotonically decreasing with $u$. The clusters of vacant sites are not fract...

We show that negative of the number of floppy modes behaves as a free energy for both connectivity and rigidity percolation, and we illustrate this result using Bethe lattices. The rigidity transition on Bethe lattices is found to be first order at a bond concentration close to that predicted by Maxwell constraint counting. We calculate the probability of a bond being on the infinite cluster and also on the overconstrained part of the infinite cluster, and show how a specific...

Reply to a comment on "Infinite-Cluster geometry in central-force networks", PRL 78 (1997), 1480. A discussion about the order of the rigidity percolation transition.

We study the backbone connecting two given sites of a two-dimensional lattice separated by an arbitrary distance $r$ in a system of size $L$. We find a scaling form for the average backbone mass: $<M_B>\sim L^{d_B}G(r/L)$, where $G$ can be well approximated by a power law for $0\le x\le 1$: $G(x)\sim x^{\psi}$ with $\psi=0.37\pm 0.02$. This result implies that $<M_B> \sim L^{d_B-\psi}r^{\psi}$ for the entire range $0<r<L$. We also propose a scaling form for the probability di...

Percolation is the paradigm for random connectivity and has been one of the most applied statistical models. With simple geometrical rules a transition is obtained which is related to magnetic models. This transition is, in all dimensions, one of the most robust continuous transitions known. We present a very brief overview of more than 60 years of work in this area and discuss several open questions for a variety of models, including classical, explosive, invasion, bootstrap...

Experimental results for covalent glasses have highlighted the existence of a new self-organized phase due to the tendency of glass networks to minimize internal stress. Recently, we have shown that an equilibrated self-organized two-dimensional lattice-based model also possesses an intermediate phase in which a percolating rigid cluster exists with a probability between zero and one, depending on the average coordination of the network. In this paper, we study the properties...

Renormalization group calculations are used to give exact solutions for rigidity percolation on hierarchical lattices. Algebraic scaling transformations for a simple example in two dimensions produce a transition of second order, with an unstable critical point and associated scaling laws. Values are provided for the order parameter exponent $\beta = 0.0775$ associated with the spanning rigid cluster and also for $d \nu = 3.533$ which is associated with an anomalous lattice d...

Many complex networks exhibit a percolation transition involving a macroscopic connected component, with universal features largely independent of the microscopic model and the macroscopic domain geometry. In contrast, we show that the transition to full connectivity is strongly influenced by details of the boundary, but observe an alternative form of universality. Our approach correctly distinguishes connectivity properties of networks in domains with equal bulk contribution...

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 \times L$ sites percolate...