Related papers: Construction of Minimum Spanning Trees from Financ…
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. x The first work to succeed in computing a…
We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an…
Little attention has been given to the correlation coefficient when data come from discrete or continuous non-normal populations. In this article, we consider the efficiency of two correlation coefficients which are from the same family,…
The minimum spanning tree (MST), a graph constructed from a distribution of points, draws lines between pairs of points so that all points are linked in a single skeletal structure that contains no loops and has minimal total edge length.…
In this article we review several techniques to extract information from stock market data. We discuss recurrence analysis of time series, decomposition of aggregate correlation matrices to study co-movements in financial data, stock level…
We review recent progress in modeling credit risk for correlated assets. We start from the Merton model which default events and losses are derived from the asset values at maturity. To estimate the time development of the asset values, the…
Correlation matrices of foreign exchange rate time series are investigated for 60 world currencies. Minimal Spanning Tree (MST) graphs for the gold, silver and platinum are presented. Inverse power like scaling is discussed for these graphs…
In the present work we analyse the dynamics of indirect connections between insurance companies that result from market price channels. In our analysis we assume that the stock quotations of insurance companies reflect market sentiments…
The minimum spanning tree, based on the concept of ultrametricity, is constructed from the correlation matrix of stock returns and provides a meaningful economic taxonomy of the stock market. In order to study the dynamics of this asset…
We study the minimum spanning tree (MST) problem in the massively parallel computation (MPC) model. Our focus is particularly on the *strictly sublinear* regime of MPC where the space per machine is $O(n^\delta)$. Here $n$ is the number of…
This paper introduces a new methodology for constructing a network of companies called a dynamic asset graph. This is similar to the dynamic asset tree studied recently, as both are based on correlations between asset returns. However, the…
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…
The Pearson product-moment correlation coefficient (rp) and the Spearman rank correlation coefficient (rs) are widely used in psychological research. We compare rp and rs on 3 criteria: variability, bias with respect to the population…
We investigate logarithmic price returns cross-correlations at different time horizons for a set of 25 liquid cryptocurrencies traded on the FTX digital currency exchange. We study how the structure of the Minimum Spanning Tree (MST) and…
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in $O(m\log\alpha(m,n))$ time, where $\alpha$ is the inverse-Ackermann function. This improves upon a long standing…
The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between pairs of edges in the tree is minimized. We first show that most of the bounding…
This paper makes two main contributions: The first is the construction of a near-minimum spanning tree with constant average distortion. The second is a general equivalence theorem relating two refined notions of distortion: scaling…
Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours). In recent work, the…
With the rapid growth of the green bond market amid increasing emphasis on sustainable development, understanding its structural properties and potential systemic risks has become essential. This study applies Minimum Spanning Tree (MST)…
The run time complexity of state-of-the-art inference algorithms in graph-based dependency parsing is super-linear in the number of input words (n). Recently, pruning algorithms for these models have shown to cut a large portion of the…