A tool for filtering information in complex systems
M. Tumminello, T. Aste, T. Di Matteo, R. N. Mantegna
Abstract
We introduce a technique to filter out complex data-sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation based graphs giving filtered graphs which preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0) triangular loops and 4 element cliques are formed. The application of this filtering procedure to 100 stocks in the USA equity markets shows that such loops and cliques have important and significant relations with the market structure and properties.
Create a lesson
Related papers
Coupling spherical p-spin systems
Riccardo Cipolloni, Leticia F. Cugliandolo
Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory
Yuto Sakurai, Takeaki Shimokawa, Kazunori Iwata et al.
Latent kinetic Ising models of neural spike trains
Davide Ghio, David Saad
Nonlocal Magic across the Many-Body Localization Crossover
Shan-Zhong Li, Zhi Li
Statistical levels and spatial modes of Fock-space heterogeneity in many-body localization crossovers
Yu-Jing Liu, Chen Cheng
Disorder-Tailored Delocalization
Yeongjun Kim, Supriyo Ghosh, Sergej Flach