Abstract
The intent of this paper is to provide a definition of a sociometric clique in the language of graph theory. This problem is viewed from two perspectives: maintaining fidelity to the intuitive notion of a clique; and providing adequate computational mechanics for large bodies of data. Luce's (1950) concept of an K-clique is used, but further qualifications are added. Two statistics or measures with associated probability distributions are defined for testing the adequacy of a subgraph which qualifies according to the definition. 1.
Users
Please
log in to take part in the discussion (add own reviews or comments).