Identifying complexity by means of matrices

DOI10.1016/S0378-4371(02)01066-XMaRDI QIDQ1850374zbMATHOpenAlexFDO

Authors 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)

Abstract: Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related characteristics. Based on several natural complex dynamical systems, like the strongly interacting quantum many-body systems, the human brain and the financial markets, by relating empirical observations to the random matrix theory and quantifying deviations in term of a reduced dimensionality, we present arguments in favour of the statement that complexity is a pheomenon at the edge between collectivity and chaos.

Recommendations

• Complexity of matrix problems
• Complexity measures of sign matrices
• Complexity of Computations with Matrices and Polynomials
• On the Gröbner complexity of matrices
• scientific article; zbMATH DE number 2104735
• The complexity of the matrix eigenproblem
• Complexity metric and structural measure on the class of deterministic matrices
• On the Complexity of Matrix Product
• Complexity of constructing Dixon resultant matrix
• Complexity metric and structural measure on the class of non deterministic matrices

Cites work

• scientific article; zbMATH DE number 3886886 (Why is no real title available?)
• scientific article; zbMATH DE number 3956145 (Why is no real title available?)
• scientific article; zbMATH DE number 1059167 (Why is no real title available?)
• Nature of order from random two-body interactions
• Neural networks and physical systems with emergent collective computational abilities
• On a class of analytic functions from the quantum theory of collisions
• On orthogonal and symplectic matrix ensembles
• On the distribution of the largest eigenvalue in principal components analysis
• Quantifying the dynamics of financial correlations

Cited in

(3)

• Complexity measures of sign matrices
• SERIAL CORRELATION, PERIODICITY AND SCALING OF EIGENMODES IN AN EMERGING MARKET
• Towards a common thread in complexity: an accuracy-based approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850374)