Connectivity of 1d random geometric graphs

Alexander P. Kartun-Giles, Kostas Koufos, Nicolas Privault

A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths…