, Volume 56, Issue 3, pp 397-417

First online:

Enumeration and simulation methods for 0–1 matrices with given marginals

  • Tom A. B. SnijdersAffiliated withDepartment of Statistics and Measurement Theory, University of GroningenDepartment of Empirical Theoretical Sociology, University of Utrecht

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Data in the form of zero-one matrices where conditioning on the marginals is relevant arise in diverse fields such as social networks and ecology; directed graphs constitute an important special case. An algorithm is given for the complete enumeration of the family of all zero-one matrices with given marginals and with a prespecified set of cells with structural zero entries. Complete enumeration is computationally feasible only for relatively small matrices. Therefore, a more useable Monte Carlo simulation method for the uniform distribution over this family is given, based on unequal probability sampling and ratio estimation. This method is applied to testing reciprocity of choices in social networks.

Key words

adjacency matrices random digraphs networks ecology Monte Carlo methods unequal probability sampling reciprocity