Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T18:19:43.199Z Has data issue: false hasContentIssue false

The Typical Rank of Tall Three-Way Arrays

Published online by Cambridge University Press:  01 January 2025

Jos M. F. Ten Berge*
Affiliation:
University of Groningen
*
Requests for reprints should be sent to Jos ten Berge, Heijmans Institute of Psychological Research, University of Groningen, Grote Kruisstraat 2/1, 9712 TS Groningen, THE NETHERLANDS. E-mail: j.m.f.ten.berge@ppsw.rug.nl

Abstract

The rank of a three-way array refers to the smallest number of rank-one arrays (outer products of three vectors) that generate the array as their sum. It is also the number of components required for a full decomposition of a three-way array by CANDECOMP/PARAFAC. The typical rank of a three-way array refers to the rank a three-way array has almost surely. The present paper deals with typical rank, and generalizes existing results on the typical rank of I × J × K arrays with K = 2 to a particular class of arrays with K ≥ 2. It is shown that the typical rank is I when the array is tall in the sense that JK − J < I < JK. In addition, typical rank results are given for the case where I equals JK − J.

Information

Type
Original Paper
Copyright
Copyright © 2000 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable