[test by reto]
|Authors:||Norman Verhelst, Reinhold Hatzinger, Patrick Mair|
|Title:||The Rasch Sampler|
|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.|
Page views:: 6589. Submitted: 2006-10-01. Published: 2007-02-22.
The Rasch Sampler
This work is licensed under the licenses
Paper: Creative Commons Attribution 3.0 Unported License
Code: GNU General Public License (at least one of version 2 or version 3) or a GPL-compatible license.