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

DOI10.1007/BF02294482zbMath0850.05002OpenAlexW2157520643MaRDI QIDQ1205742

Tom A. B. Snijders

Publication date: 1 April 1993

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02294482

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Enumeration in graph theory (05C30)

Related Items (23)

The power function of conditional tests of the Rasch model ⋮ Randomized Reference Models for Temporal Networks ⋮ Mathematical programming approaches for classes of random network problems ⋮ A tutorial on methods for the modeling and analysis of social network data ⋮ State-Dependent Kernel Selection for Conditional Sampling of Graphs ⋮ Simple existence conditions for zero-one matrices with at most one structural zero in each row and column ⋮ Estimating the number of zero-one multi-way tables via sequential importance sampling ⋮ A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins ⋮ Sample size determination for Rasch model tests ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ Distribution of some similarity coefficients for dyadic binary data in the case of associated attributes ⋮ Social structure, networks, and E‐state structuralism models ⋮ Stochastic actor‐oriented models for network change ⋮ Models for network evolution ⋮ Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\) ⋮ Sampling for Conditional Inference on Network Data ⋮ Exact tests for the Rasch model via sequential importance sampling ⋮ Hybrid schemes for exact conditional inference in discrete exponential families ⋮ A Legendre pair of length 77 using complementary binary matrices with fixed marginals ⋮ An efficient MCMC algorithm to sample binary matrices with fixed marginals ⋮ Sequential importance sampling of binary sequences ⋮ Randomization methods for assessing data analysis results on real‐valued matrices ⋮ Statistical evaluation of algebraic constraints for social networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The variance of the number of mutual choices in sociometry
• A theorem on flows in networks
• Zero-one matrices with zero trace
• A survey of algorithms for exact distributions of test statistics in r\(\times c\) contingency tables with fixed margins
• The asymptotic number of non-negative integer matrices with given row and column sums
• Combinatorial Properties of Matrices of Zeros and Ones
• Probability Distributions of Random Variables Associated with a Structure of the Sample Space of Sociometric Investigations
• Transitivity and the path census in sociometry
• An Exponential Family of Probability Distributions for Directed Graphs
• Random directed graph distributions and the triad census in social networks†
• The structural implications of measurement error in sociometry†
• A biometrical study of Micraster coranguinum and M. (Isomicraster) senonensis
• The Number of Locally Restricted Directed Graphs

This page was built for publication: Enumeration and simulation methods for 0-1 matrices with given marginals