Exchangeable Rasch matrices

Abstract

This article is concerned with binary random matrices that are exchangeable with the probability of any finite submatrix only depending on its row- and column sums. We describe basic representations of such matrices both in the case of full row- and column exchangeability and the case of weak exchangeability. Finally the results are interpreted in terms of random graphs with exchangeable labels and with a view towards their potential application to social network analysis.

Keywords

• partial exchangeability
• random graphs
• social network analysis
• sufficiency