Godehardt, Erhard; Jaworski, Jerzy On the connectivity of a random interval graph. (English) Zbl 0864.05080 Random Struct. Algorithms 9, No. 1-2, 137-161 (1996). A random graph is defined on a set of \(n\) independent random variables having a uniform distribution on the unit interval by connecting with an edge any pair of variables that are at most a distance \(d\) apart. The probability distribution of the number of connected components and various related results are given. Reviewer: O.Frank (Stockholm) Cited in 12 Documents MSC: 05C80 Random graphs (graph-theoretic aspects) 05C40 Connectivity Keywords:connectivity; random interval graph; random graph; probability distribution PDFBibTeX XMLCite \textit{E. Godehardt} and \textit{J. Jaworski}, Random Struct. Algorithms 9, No. 1--2, 137--161 (1996; Zbl 0864.05080) Full Text: DOI