| WELLMAN, B., FRANK, O., ESPINOZA, V., LUNDQUIST, S., and WILSON, C. (1991), "Integrating individual, relational and structural analysis", Social Networks, 13, 223 -- 249. |
....for the number of edges and for the vector of triad counts in the undirected graph. Janson and Nowicki (1991) studied the asymptotic distributions of the vector of suitable normalized subgraph counts for undirected and directed colored graphs and random colored tournaments. Frank (1988b) and Wellman, Frank, Espinoza, Lundquist, and Wilson (1991) considered statistical inference for certain models for randomly colored graphs assuming that the edges as well as the colors are observed. In this paper we consider a structure (Y, X) with randomly colored vertices as given by (3) assuming that only the relational structure Y can be observed, ....
WELLMAN, B., FRANK, O., ESPINOZA, V., LUNDQUIST, S., and WILSON, C. (1991), "Integrating individual, relational and structural analysis", Social Networks, 13, 223 -- 249.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC