Exact moments of the symmetric cubic assignment statistic

Abstract

Hubert (1987Assignment Methods in Combinatorial Data Analysis) presented a class of permutation, or random assignment, techniques for assessing correspondence between general k-dimensional proximity measures on a set of “objects.” A major problem in higher-order assignment models is the prohibitive level of computation that is required. We present the first three exact moments of a test statistic for the symmetric cubic assignment model. Efficient computational formulas for the first three moments have been derived, thereby permitting approximation of the permutation distribution using well-known methods.

Keywords:

• Pearson distribution
• permutation test