We show that the variance of the number of edges in the random sphere of in
fluence graph built on n i.i.d. sites which are uniformly distributed over
the unit cube in R-d, grows linearly with n. This is then used to establish
a central limit theorem for the number of edges in the random sphere of in
fluence graph built on a Poisson number of sites. Some related proximity gr
aphs are discussed as well. (C) 1999 John Wiley & Sons, Inc.