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. (authors' abstract)
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:5022 |
| Date | 22 February 2007 |
| Creators | Verhelst, Norman D., Hatzinger, Reinhold, Mair, Patrick |
| Publisher | Foundation for Open Access Statistics |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Relation | http://www.jstatsoft.org/v20/i04/paper, http://www.foastat.org/, https://www.jstatsoft.org/about/editorialPolicies#openAccessPolicy, http://epub.wu.ac.at/5022/ |
Page generated in 0.0023 seconds