pith. sign in

arxiv: cond-mat/0112271 · v1 · submitted 2001-12-14 · ❄️ cond-mat.soft · nlin.AO· nucl-th· q-fin.ST

Identifying Complexity by Means of Matrices

classification ❄️ cond-mat.soft nlin.AOnucl-thq-fin.ST
keywords complexitymatricesquantifyingsystemsaddressesapproachingargumentsbrain
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.