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

Optimality problem of network topology in stocks market analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(13 citation statements)
references
References 39 publications
0
13
0
Order By: Relevance
“…For example, principal component analysis (Loretan, 1997), neural network (Fu and Kara, 2011;Kara et al, 2011), minimum spanning tree (Sharif et al, 2012;Rostrup et al, 2013;Setiawan, 2014) and optimal minimum spanning tree (Djauhari, 2013;Djauhari and Gan, 2015). In this case, every stock is considered as a complex network system consisting of 77 stocks as nodes connected by several numbers of links.…”
Section: Optimal Minimum Spanning Treementioning
confidence: 99%
See 1 more Smart Citation
“…For example, principal component analysis (Loretan, 1997), neural network (Fu and Kara, 2011;Kara et al, 2011), minimum spanning tree (Sharif et al, 2012;Rostrup et al, 2013;Setiawan, 2014) and optimal minimum spanning tree (Djauhari, 2013;Djauhari and Gan, 2015). In this case, every stock is considered as a complex network system consisting of 77 stocks as nodes connected by several numbers of links.…”
Section: Optimal Minimum Spanning Treementioning
confidence: 99%
“…Subsequently, the SDU of D is the min-max transitive closure denoted by D *K for an integer; 2≤K≤n (Djauhari and Gan, 2015).…”
Section: Omst Algorithmmentioning
confidence: 99%
“…Kwapień et al [15] introduced a family of q-dependent minimum spanning trees (qMSTs) that are selective for cross-correlations between different fluctuation amplitudes and different time scales of multivariate data. Djauhari et al [16] introduced a set of optimality criteria and proposed the process of selecting the optimal MST. Through the analysis of the planar maximally-filtered graphs (PMFG) of the portfolio of the 300 stocks traded, Tumminello et al [17] confirmed that the selected stocks composed a hierarchical system progressively structuring as the sampling time horizon increases.…”
Section: Introductionmentioning
confidence: 99%
“…In order to obtain the embodying economic information from the stock market analysis, many researchers have risen up to investigate in this area. There are various approaches being used in filtering the information from the stock network structure such as minimum spanning tree (MST) [1][2][10][11], planar maximally filtered graph [12][13], average linkage-based MSTs [14] and Directed Bubble Hierarchical Tree [15]. MST is the simplest and well-known method for filtering the information that contained in the stock network structure among these approaches.…”
Section: Introductionmentioning
confidence: 99%