February 27, 1997
Using a recently developed algorithm for generic rigidity of two-dimensional graphs, we analyze rigidity and connectivity percolation transitions in two dimensions on lattices of linear size up to L=4096. We compare three different universality classes: The generic rigidity class; the connectivity class and; the generic ``braced square net''(GBSN). We analyze the spanning cluster density P_\infty, the backbone density P_B and the density of dangling ends P_D. In the generic rigidity and connectivity cases, the load-carrying component of the spanning cluster, the backbone, is fractal at p_c, so that the backbone density behaves as B ~ (p-p_c)^{\beta'} for p>p_c. We estimate \beta'_{gr} = 0.25 +/- 0.02 for generic rigidity and \beta'_c = 0.467 +/- 0.007 for the connectivity case. We find the correlation length exponents, \nu_{gr} = 1.16 +/- 0.03 for generic rigidity compared to the exact value for connectivity \nu_c = 4/3. In contrast the GBSN undergoes a first-order rigidity transition, with the backbone density being extensive at p_c, and undergoing a jump discontinuity on reducing p across the transition. We define a model which tunes continuously between the GBSN and GR classes and show that the GR class is typical.
Similar papers 1
December 20, 2014
We study rigidity percolation transitions in two-dimensional central-force isostatic lattices, including the square and the kagome lattices, as next-nearest-neighbor bonds ("braces") are randomly added to the system. In particular, we focus on the differences between regular lattices, which are perfectly periodic, and generic lattices with the same topology of bonds but whose sites are at random positions in space. We find that the regular square and kagome lattices exhibit a...
July 1, 1998
We summarize ideas and methods that apply to rigidity and connectivity percolation. These include: constraint counting concepts, exact calculations on diluted trees and numerical results on diluted lattices using matching algorithms. The similarities and differences between connectivity and rigidity percolation are discussed.
July 20, 2011
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation transition which we study analytically by mapping it to a connectivity problem of two-colored random graphs. We derive an exact recurrence equation for the probability of having a rigid percolating cluster and solve it in the infinite volume ...
July 26, 2018
We introduce two new concepts, frictional rigidity percolation and minimal rigidity proliferation, to help identify the nature of the frictional jamming transition as well as significantly broaden the scope of rigidity percolation. For frictional rigidity percolation, we construct rigid clusters in two different lattice models using a $(3,3)$ pebble game, while taking into account contacts below and at the Coulomb threshold. The first lattice is a honeycomb lattice with next-...
June 25, 2020
Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to mobility, node or edge failures, and varying traffic loads. Percolation theory quantifies the threshold value of a local control parameter such as a node occupation (resp., deletion) probability or an edge activation (resp., removal) probabil...
September 20, 2013
Rigidity Percolation is studied analytically on randomly bonded networks with two types of nodes, respectively with coordination numbers $z_1$ and $z_2$, and with $g_1$ and $g_2$ degrees of freedom each. For certain cases that model chalcogenide glass networks, two transitions, both of first order, are found, with the first transition usually rather weak. The ensuing intermediate pase, although is not isostatic in its entirety, has very low self-stress. Our results suggest a ...
December 18, 2018
In ordinary solids, material disorder is known to increase the size of the process zone in which stress concentrates at the crack tip, causing a transition from localized to diffuse failure. Here, we report experiments on disordered 2D lattices, derived from frictional particle packings, in which the mean coordination number $\langle z \rangle$ of the underlying network provides a similar control. Our experiments show that tuning the connectivity of the network provides acces...
February 27, 2007
A fast computer algorithm, the pebble game, has been used successfully to study rigidity percolation on 2D elastic networks, as well as on a special class of 3D networks, the bond-bending networks. Application of the pebble game approach to general 3D networks has been hindered by the fact that the underlying mathematical theory is, strictly speaking, invalid in this case. We construct an approximate pebble game algorithm for general 3D networks, as well as a slower but exact...
October 12, 2022
The rigidity transition occurs when, as the density of microscopic components is increased, a disordered medium becomes able to transmit and ensure macroscopic mechanical stability, owing to the appearance of a space-spanning rigid connected component, or cluster. As a continuous phase transition it exhibits a scale invariant critical point, at which the rigid clusters are random fractals. We show, using numerical analysis, that these clusters are also conformally invariant, ...
July 24, 2009
We introduce models of generic rigidity percolation in two dimensions on hierarchical networks, and solve them exactly by means of a renormalization transformation. We then study how the possibility for the network to self organize in order to avoid stressed bonds may change the phase diagram. In contrast to what happens on random graphs and in some recent numerical studies at zero temperature, we do not find a true intermediate phase separating the usual rigid and floppy one...