The Rasch Sampler

Norman Verhelst, Reinhold Hatzinger, Patrick Mair

Main Article Content

Abstract

The Rasch sampler is an efficient algorithm to sample binary matrices with given marginal sums. It is a Markov chain Monte Carlo (MCMC) algorithm. The program can handle matrices of up to 1024 rows and 64 columns. A special option allows to sample square matrices with given marginals and fixed main diagonal, a problem prominent in social network analysis. In all cases the stationary distribution is uniform. The user has control on the serial dependency.

Article Details

Article Sidebar

Files:
Paper R package (RaschSampler) v20i04.R: R example code from the paper
Published:
Feb 22, 2007
DOI:
10.18637/jss.v020.i04