Let i = 1, . . . , N index a simple random sample of units drawn from some large population. For each unit we observe the vector of regressors Xi and, for each of the N (N - 1) ordered pairs of units, an outcome Yij . The outcomes Yij and Ykl are independent if their indices are disjoint, but...

Let i = 1, . . . , N index a simple random sample of units drawn from some large population. For each unit we observe the vector of regressors Xi and, for each of the N (N - 1) ordered pairs of units, an outcome Yij . The outcomes Yij and Ykl are independent if their indices are disjoint, but...

We propose a random network model incorporating heterogeneity of agents and a continuous notion of homophily. Unlike the vast majority of the corresponding economic literature, we capture homophily in terms of similarity rather than equality by assuming that the probability of linkage between...

We propose a random network model incorporating heterogeneity of agents and a continuous notion of homophily. Unlike the vast majority of the corresponding economic literature, we capture homophily in terms of similarity rather than equality by assuming that the probability of linkage between...

We propose a random network model incorporating heterogeneity of agents and a continuous notion of homophily. Unlike the vast majority of the corresponding economic literature, we capture homophily in terms of similarity rather than equality of agents. We show that if links between similar...

We propose a random network model incorporating heterogeneity of agents and a continuous notion of homophily. Unlike the vast majority of the corresponding economic literature, we capture homophily in terms of similarity rather than equality of agents. We show that if links between similar...

In this paper we describe a Sequential Importance Sampling (SIS) procedure for counting the number of vertex covers in general graphs. The performance of SIS depends heavily on how close the SIS proposal distribution is to a uniform one over a suitably restricted set. The proposed algorithm...

In this paper we describe a Sequential Importance Sampling (SIS) procedure for counting the number of vertex covers in general graphs. The performance of SIS depends heavily on how close the SIS proposal distribution is to a uniform one over a suitably restricted set. The proposed algorithm...