An efficient MCMC algorithm to sample binary matrices with fixed marginals

DOI10.1007/s11336-008-9062-3zbMath1284.62757MaRDI QIDQ998842

Norman D. Verhelst

Publication date: 30 January 2009

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11336-008-9062-3

zbMATH Keywords

importance sampling; social networks; MCMC; Rasch model; nonparametric tests

Mathematics Subject Classification ID

62G10: Nonparametric hypothesis testing

91D30: Social networks; opinion dynamics

65C05: Monte Carlo methods

62P15: Applications of statistics to psychology

Related Items

Sample size determination for Rasch model tests, Constrained Markovian dynamics of random graphs, A tutorial on methods for the modeling and analysis of social network data

Uses Software

• T-Rasch

Cites Work

• A theorem on flows in networks
• Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
• Enumeration and simulation methods for 0-1 matrices with given marginals
• Exact tests for the Rasch model via sequential importance sampling
• Nonparametric goodness-of-fit tests for the Rasch model
• Combinatorial Properties of Matrices of Zeros and Ones
• Random directed graph distributions and the triad census in social networks†
• Sequential Imputations and Bayesian Missing Data Problems
• Generalized Monte Carlo significance tests
• Stochastic Modeling of Scientific Data
• Monte Carlo sampling methods using Markov chains and their applications
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Inequalities: theory of majorization and its applications
• Tools for statistical inference. Methods for the exploration of posterior distributions and likelihood functions.
• Unnamed Item
• Unnamed Item
• Unnamed Item