We introduce the concept of a triad census of a digraph arid show how it can be used to enumerate various types of subgraph configurations. We give the basic probabilities needed for computing means and variances for a triad census under the U-MAN distribution for digraphs. These concepts are...

We introduce the concept of a triad census of a digraph arid show how it can be used to enumerate various types of subgraph configurations. We give the basic probabilities needed for computing means and variances for a triad census under the U-MAN distribution for digraphs. These concepts are...

A general or omnibus test of structure in social network data is proposed. The test exploits all of the information contained in the triad census. Analogous to the classical F-test for contrasts among means, the proposed test involves finding a weighting vector which maximizes a test statistic,...

This paper gives the formulas for and derivation of ridge regression methods when there are weights associated with each observation. A Bayesian motivation is used and various choices of k are discussed. A suggestion is made as to how to combine ridge regression with robust regression methods

This paper gives an alternative derivation of a Monte Carlo method that has been used to study robust estimators. Extensions of the technique to the regression case are also considered and some computational points are briefly mentioned

A description of a system of subroutines to compute solutions to the iteratively reweighted least squares problem is presented. The weights are determined from the data and linear fit and are computed as functions of the scaled residuals. Iteratively reweighted least squares is a part of robust...