Connectivity of random regular graphs generated by the pegging algorithm

It is shown that the connectivity of random d‐regular graphs which are recursively generated by an algorithm motivated by a peer‐to‐peer network are asymptotically almost surely d‐connected for any even constant d⩾4.