2019
DOI: 10.3934/jdg.2019010
|View full text |Cite
|
Sign up to set email alerts
|

An application of minimal spanning trees and hierarchical trees to the study of Latin American exchange rates

Abstract: This paper analyzes a group of nine Latin American currencies with the aim of identifying clusters of exchange rates with similar co-movements. In this work the study of currency relationships is formulated as a network problem, where each currency is represented as a node and the relationship between each pair of currencies as a link. The paper combines two methods, Symbolic Time Series Analysis (STSA) and a clustering method based on the Minimal Spanning Tree (MST), from which we obtain a Hierarchical Tree (… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 35 publications
0
8
0
Order By: Relevance
“…For this reason, the correlation matrix is transformed into the correlation distance matrix according to the Equation 2 which fulfills the three axioms of an Euclidean distance: Subsequently, Prim’s algorithm (Prim, 1957) is applied to adjacency matrix to obtain Minimal Spanning Trees (MST). Being introduced to graph theory by Kruskal (1956) and Prim (1957), MST have been a widely used tool (Limas, 2019; Górski et al, 2008; Kwapień et al, 2009; Rešovský et al, 2013; Wang et al, 2013), mainly because it simplifies network analysis by selecting the most relevant bounds. Indeed, MST are characterized for representing the core information of a complete network with n nodes by selecting the n-1 links that minimize the overall distance.…”
Section: Methodsmentioning
confidence: 99%
“…For this reason, the correlation matrix is transformed into the correlation distance matrix according to the Equation 2 which fulfills the three axioms of an Euclidean distance: Subsequently, Prim’s algorithm (Prim, 1957) is applied to adjacency matrix to obtain Minimal Spanning Trees (MST). Being introduced to graph theory by Kruskal (1956) and Prim (1957), MST have been a widely used tool (Limas, 2019; Górski et al, 2008; Kwapień et al, 2009; Rešovský et al, 2013; Wang et al, 2013), mainly because it simplifies network analysis by selecting the most relevant bounds. Indeed, MST are characterized for representing the core information of a complete network with n nodes by selecting the n-1 links that minimize the overall distance.…”
Section: Methodsmentioning
confidence: 99%
“…Log-returns and volatilities can obviously be calculated from the price of any financial asset: Foreign exchange [15], [21]; American stocks [1], [7], [13]; Korean stocks [22]; European Government bonds are discussed in [3]; Cryptocurrencies [5], [23]; Oil prices [6]; Furthermore, a single network can represent a market or an economy over a long period of time, but it is also possible to create timevarying graphs for smaller consecutive overlapping or nonoverlapping periods of time [9], [2]. This approach is appropriate when the objective is to analyze how the network changes in response to a financial crisis, and what is the timeevolving behavior of interdependencies between different assets.…”
Section: Marketsmentioning
confidence: 99%
“…The analysis of pairwise relationships between assets, as discussed in Section II, would initially produce a fully connected weighted graph, hence, from this point of view, extracting MSTs can be considered as a filtering procedure [14], which highlights relevant relationships between assets [15]. Weak correlations or causal relationships are simply excluded from the resulting trees, as they correspond to edges with large weights.…”
Section: Topology and Spanning Treesmentioning
confidence: 99%
See 1 more Smart Citation
“…Subsequently, Prim's algorithm [26] is applied to adjacency matrix to obtain Minimal Spanning Trees (MST). Being introduced to graph theory by [17] and [26], MST have been a widely used tool [19,15,18,27,33], mainly because it simplifies network analysis by selecting the most relevant bounds. Indeed, MST are characterized by representing the core information of a complete network with n nodes by selecting the n − 1 links that minimize the overall distance.…”
mentioning
confidence: 99%