Abstract
SummaryRandom associations of points on a graph Let be given a graph consisting of n points, numbered from 1, …, n, and mij joins between points i and j. From this graph r points are chosen at random. This paper deals with the properties of a statistic x, being the number of joins between chosen points. Applications are considered to a test for randomness, and to the order‐disorder problem. Analogous results for other statistics and also for the case in which the points are sampled independently of each other, are announced. These results are described in Bloemena, (1960).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
