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 algorithm, the relaxation algorithm, that we use for
testing the new pebble game. Based on the results of these tests and additional
considerations, we argue that in the particular case of randomly diluted
central-force networks on BCC and FCC lattices, the pebble game is essentially
exact. Using the pebble game, we observe an extremely sharp jump in the largest
rigid cluster size in bond-diluted central-force networks in 3D, with the
percolating cluster appearing and taking up most of the network after a single
bond addition. This strongly suggests a first order rigidity percolation
transition, which is in contrast to the second order transitions found
previously for the 2D central-force and 3D bond-bending networks. While a first
order rigidity transition has been observed for Bethe lattices and networks
with ``chemical order'', this is the first time it has been seen for a regular
randomly diluted network. In the case of site dilution, the transition is also
first order for BCC, but results for FCC suggest a second order transition.
Even in bond-diluted lattices, while the transition appears massively first
order in the order parameter (the percolating cluster size), it is continuous
in the elastic moduli. This, and the apparent non-universality, make this phase
transition highly unusual.Comment: 28 pages, 19 figure