Nodes placed uniformly at random; edges connect nodes within distance r. Watch the giant component appear at the percolation threshold r_c ≈ √(log N / πN). Colors show connected components.
Random geometric graphs (Gilbert 1961): N points uniform in [0,1]², edges if |x-y|