Title of article
Pruning a minimum spanning tree
Author/Authors
Sandoval Jr.، نويسنده , , Leonidas، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
34
From page
2678
To page
2711
Abstract
This work employs various 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 strength of a connection by its survival rate, which is the amount of time a connection between two stock market indices endures. 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, in which most of the connections are either strong or enduring in time.
Keywords
Random matrix theory , Minimum spanning tree , pruning , Financial markets
Journal title
Physica A Statistical Mechanics and its Applications
Serial Year
2012
Journal title
Physica A Statistical Mechanics and its Applications
Record number
1735410
Link To Document