Probability Tables for Cluster Analysis Based on a Theory of Random Graphs.
Abstract
Statistics based on a theory of random graphs have been proposed to be used as an analytic aid to assess the randomness of a clustered structure. Probability tables for two such statistics are tabulated. Exact values of P sub(n,v), the cumulative probabilities of the minimum number of edges needed to connect a random graph, are tabulated for n = 10(1)30(5)60. Exact and approximate values of E sub(n,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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1974
- Accession Number
- ADA009857
Entities
People
- G. Killough
- R. Ling
Organizations
- Clemson University