Uniform sampling of binary matrices with fixed margins is known as a difficult problem. Two classes of algorithms to sample from a distribution not too different from the uniform are studied in the literature: importance sampling and Markov chain Monte Carlo (MCMC). Existing MCMC algorithms converge slowly, require a long burn-in period and yield highly dependent samples. Chen et al. developed an importance sampling algorithm that is highly efficient for relatively small tables. For larger but still moderate sized tables (300×30) Chen et al.’s algorithm is less efficient. This article develops a new MCMC algorithm that converges much faster than the existing ones and that is more efficient than Chen’s algorithm for large problems. Its stationary distribution is uniform. The algorithm is extended to the case of square matrices with fixed diagonal for applications in social network theory.

Recent studies pertaining to an extended class of matched pairs tests based on powers of ranks are discussed. Previous questions regarding the asymptotic properties for this class of tests are clarified and a generalization of this class is described. This generalization raises a previously unanticipated concern about whether or not the analytic comparisons resulting from these tests correspond with an intuitive notion of what is being compared.

A Monte Carlo algorithm realizing a family of nonparametric tests for the Rasch model is introduced which are conditional on the item and subject marginals. The algorithm is based on random changes of elements of data matrices without changing the marginals; most powerful tests against all alternative hypotheses are given for which a monotone characteristic may be computed from the data matrix; alternatives may also be composed. Computation times are long, but exactp-values are approximated with the quality of approximation only depending on calculation time, but not on the number of persons. The power and the flexibility of the procedure is demonstrated by means of an empirical example where, among others, indicators for increased item similarities, the existence of subscales, violations of sufficiency of the raw score as well as learning processes were found. Many of the features described are implemented in the program T-Rasch 1.0 by Ponocny and Ponocny-Seliger (1999).

Weak separability is a key admissibility property in the Divisia approach to monetary aggregation. We test groups of U.K. household sector monetary assets for weak separability using new data underlying the Bank of England's benchmark revision of its household sector Divisia index. Nonparametric tests are used to identify four monetary asset groupings, which are weakly separable over all or almost all of the post-ERM period (1992:4–2005:1). We construct Divisia monetary aggregates for these four groupings and investigate their information content in two applications. The main findings are that Divisia money has direct effects on aggregate demand and that the growth rates of the nominal Divisia monetary aggregates Granger cause nominal output growth, but not inflation.

The Generalized Axiom of Revealed Preference (GARP) can be violated because of random measurement errors in the observed quantity data. We study two tests proposed by Varian (1985) and de Peretti (2004), which test GARP within an explicit stochastic framework. Both tests compute adjusted quantity data that are compliant with GARP. We compare and contrast the two tests in theoretical terms and in an empirical application. The empirical application is based on testing a large group of monetary assets for the United States over multiple sample periods spanning 1960–1992. We found that both tests provided reasonable results and were largely consistent with each other.