Pruning a Minimum Spanning Tree
Leonidas Sandoval Junior
Papers from arXiv.org
This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the study of random networks with the same probability density distribution of the original data. The second technique is to judge the strengh of a connection by its survival rate, which is the amount of time a connection between two stock market indices endure. The idea is that true connections will survive for longer periods of time, and that random connections will not. That information is then combined with the information obtained from the first technique in order to create a smaller network, where most of the connections are either strong or enduring in time.
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed
Published in Physica A 391 (2012) 2678-2711
Downloads: (external link)
http://arxiv.org/pdf/1109.0642 Latest version (application/pdf)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: http://EconPapers.repec.org/RePEc:arx:papers:1109.0642
Access Statistics for this paper
More papers in Papers from arXiv.org
Series data maintained by arXiv administrators ().