This is the authors' abstract. We don't add key points for this paper.
The celebrated elliptic law describes the distribution of eigenvalues of random matrices with correlations between off-diagonal pairs of elements, having applications to a wide range of physical and biological systems. Here, we investigate the generalization of this law to random matrices exhibiting higher-order cyclic correlations between k tuples of matrix entries. We show that the eigenvalue spectrum in this ensemble is bounded by a hypotrochoid curve with k-fold rotational symmetry. This hypotrochoid law applies to full matrices as well as sparse ones, and thereby holds with remarkable universality. We further extend our analysis to matrices and graphs with competing cycle motifs, which are described more generally by polytrochoid spectral boundaries.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Aceituno et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: