ScholarLens Back to search
2000•PsychometrikaRequires access

The Typical Rank of Tall Three-Way Arrays

Jos M. F. ten Berge

Open publisher page 54 citations

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 .

About this research paper

What this paper is about

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 .

Why it matters

OpenAlex reports 54 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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 .

Key concepts: Rank (graph theory), Mathematics, Combinatorics, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Typical Rank of Tall Three-Way Arrays — Research Paper | ScholarLens