Data analysis and the connectivity of random graphs

This paper presents empirical information on the adequacy of an asymptotic approximation developed by Erdös and Rényi dealing with the minimum number of lines needed to connect a random graph. It is shown that the approximation is poor for several data analysis applications of the result previously published in the behavioral sciences.