Probability Tables for Cluster Analysis Based on a Theory of Random Graphs
- 1 June 1976
- journal article
- research article
- Published by JSTOR in Journal of the American Statistical Association
- Vol. 71 (354) , 293
- https://doi.org/10.2307/2285300
Abstract
Statistics based on a theory of random graphs have been proposed as an analytic aid to assess the randomness of a clustered structure. Probability tables for two such statistics are tabulated. Exact values of Pn,v , the cumulative probabilities of the minimum number of edges needed to connect a random graph, are tabulated for n = 10(1)30(5)80-(10)100. Exact and approximate values of En,v, the expected number of components in a random graph with n vertices and v edges, are tabulated for n = 10(1)30(5)100.Keywords
This publication has 0 references indexed in Scilit: