2013
DOI: 10.1016/j.physa.2012.12.032
|View full text |Cite
|
Sign up to set email alerts
|

Minimal spanning tree problem in stock networks analysis: An efficient algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 16 publications
0
13
0
Order By: Relevance
“…It provides N-1 stronger (i.e., shorter) links between stocks that span all the stocks. In this paper the improved Kruskal's algorithm suggested by Djauhari and Gan [53] is used. Fig.…”
Section: Resultsmentioning
confidence: 99%
“…It provides N-1 stronger (i.e., shorter) links between stocks that span all the stocks. In this paper the improved Kruskal's algorithm suggested by Djauhari and Gan [53] is used. Fig.…”
Section: Resultsmentioning
confidence: 99%
“…we construct the MST for N currencies in the FX market via using the Kruskal's algorithm [58,59]. For each time scale s, the MST network of the FX market connects the N currencies (nodes) with N−1 stronger links such that no loops are produced, i.e., the FX network is structured with the strongest cross-correlations of each currency [23].…”
Section: Methodsmentioning
confidence: 99%
“…This is one of the advantages of Kruskal's algorithm that is usually used in stocks network analysis based on MST such as presented in the literature, for example, Refs. [3,4,7,12,13,21,30,34,40]. Based on that property, the merits of the proposed method can be seen in Section 4 where the promising results are presented and discussed.…”
Section: Motivation: Case Of Nysementioning
confidence: 97%
“…If C consists of more than one MST, an optimal one is still hard to find even in F . Here, we develop the idea of Djauhari and Gan [40] to simplify the problem and get the solution.…”
Section: Construction Of the Forestmentioning
confidence: 99%