Identifying complexity by means of matrices

DOI10.1016/S0378-4371(02)01066-XzbMath1001.37088arXivcond-mat/0112271OpenAlexW2079482892MaRDI QIDQ1850374

Yanyan Li

Publication date: 3 December 2002

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0112271

zbMATH Keywords

random matrix theorycomplex dynamical systemsreduced dimensionality

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Approximation methods and numerical treatment of dynamical systems (37M99)

Related Items (1)

SERIAL CORRELATION, PERIODICITY AND SCALING OF EIGENMODES IN AN EMERGING MARKET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of the largest eigenvalue in principal components analysis
• On orthogonal and symplectic matrix ensembles
• On a class of analytic functions from the quantum theory of collisions
• Neural networks and physical systems with emergent collective computational abilities.
• Quantifying the dynamics of financial correlations
• Nature of order from random two-body interactions

This page was built for publication: Identifying complexity by means of matrices