An efficient MCMC algorithm to sample binary matrices with fixed marginals
From MaRDI portal
Recommendations
Cites work
- A theorem on flows in networks
- Combinatorial Properties of Matrices of Zeros and Ones
- Enumeration and simulation methods for 0-1 matrices with given marginals
- Exact tests for the Rasch model via sequential importance sampling
- Generalized Monte Carlo significance tests
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 1089130 (Why is no real title available?)
- scientific article; zbMATH DE number 3223985 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Monte Carlo sampling methods using Markov chains and their applications
- Nonparametric goodness-of-fit tests for the Rasch model
- Random directed graph distributions and the triad census in social networks†
- Sequential Imputations and Bayesian Missing Data Problems
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
- Stochastic Modeling of Scientific Data
- Tools for statistical inference. Methods for the exploration of posterior distributions and likelihood functions.
Cited in
(24)- Constrained Markovian dynamics of random graphs
- The power function of conditional tests of the Rasch model
- Simulating longer vectors of correlated binary random variables via multinomial sampling
- Sampling hypergraphs with given degrees
- Generating MCMC proposals by randomly rotating the regular simplex
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
- Bayesian conditional inference for Rasch models
- A tutorial on methods for the modeling and analysis of social network data
- Mathematical programming approaches for classes of random network problems
- Exact sampling and counting for fixed-margin matrices
- scientific article; zbMATH DE number 1089130 (Why is no real title available?)
- Configuring random graph models with fixed degree sequences
- Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence
- Parallel and I/O-efficient randomisation of massive networks using global curveball trades
- Moments of uniform random multigraphs with fixed degree sequences
- State-Dependent Kernel Selection for Conditional Sampling of Graphs
- Efficient Bayesian analysis of multivariate aggregate choices
- EM estimation for finite mixture models with known mixture component size
- Sample size determination for Rasch model tests
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Hypercurveball algorithm for sampling hypergraphs with fixed degrees
- MCMC conditional maximum likelihood for the two-way fixed-effects logit
- A statistical test for differential item pair functioning
- MCMC algorithms for constrained variance matrices
This page was built for publication: An efficient MCMC algorithm to sample binary matrices with fixed marginals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998842)
