Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

1223 · Jun 201419922001200920172026
48 results for MST

Study measures uncertainty in MST identification across different correlation networks.

problem Uncertainty in MST identification across various correlation-based market networks.
method Developed a framework using random variable networks (RVN) to measure uncertainty of MST identification.
result FDR is the most appropriate measure for MST identification reliability.

This paper uses rank correlation methods to construct MSTs from financial returns, finding them more stable and robust.

problem Stability and robustness of MSTs constructed from financial correlation matrices.
method Pearson, Spearman, and Kendall's ττ rank correlation methods applied to daily financial returns.
result Rank MSTs are more stable and robust than MSTs constructed using Pearson correlation.

New approach uses MST and copula-DCC-GARCH for systemic risk analysis in European insurance sector.

problem Analyzing systemic risk in European insurance sector through indirect connections.
method Combining copula-DCC-GARCH model and Minimum Spanning Trees (MST) for interlinkage dynamics analysis.
result Proposed approach useful for systemic risk analysis in insurance sector, with MST topological indicators as predictors.

Paper introduces a new gradient statistic to improve deep learning convergence.

problem Fluctuation effect of gradient updates between iterations.
method Introduces an unbiased stratified statistic \(\bar{G}_{mst}\) and a new algorithm MSSG.
result MSSG algorithm outperforms other sgd-like algorithms in training deep models.

A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST …

2008-10-07abs ↗pdf ↗

MSTs provide a fast and meaningful clustering method in low-dimensional data.

problem Quantifying the effectiveness of MSTs in low-dimensional clustering tasks.
method Identifying upper bounds for MST performance, reviewing and extending existing MST-based partitioning schemes.
result MST methods can be very competitive, often outperforming traditional clustering algorithms.

We calculated the cross correlations between the half-hourly times series of the ten Dow Jones US economic sectors over the period February 2000 to August 2008, the two-year intervals 2002--2003, 2004--2005, 2008--2009, and also over 11 segments within the present financial crisis, to construct minimal spanning trees (…

2010-09-29abs ↗pdf ↗

This study analyzes cryptocurrency market dynamics using a novel qq-dependent detrended cross-correlation method.

problem Capturing correlations at varying fluctuation amplitudes and time scales in complex systems.
method Extends traditional metrics with qq-dependent detrended cross-correlation coefficient ρ(q,s) and qqMSTs.
result Significant shifts in network structures during major disruptions, leading to decentralized correlations.

A large set of daily FOREX time series is analyzed. The corresponding correlation matrices (CM) are constructed for USD, EUR and PLZ used as the base currencies. The triangle rule is interpreted as constraints reducing the number of independent returns. The CM spectrum is computed and compared with the cases of shuffle…

2006-06-02abs ↗pdf ↗

With the development and widespread use of wireless devices in recent years (mobile phones, Internet of Things, Wi-Fi), the electromagnetic spectrum has become extremely crowded. In order to counter security threats posed by rogue or unknown transmitters, it is important to identify RF transmitters not by the data cont…

2017-11-05abs ↗pdf ↗

Study optimizes stock portfolios using network analysis and forecasting.

problem Optimizing stock portfolios with network analysis and forecasting.
method Constructs dependency networks using VAR and FEVD, applies MST algorithm, and incorporates ARIMA and NNAR forecasts.
result MST-based strategies outperform buy-and-hold benchmarks, achieving higher returns.

Extends geostatistical simulation method to handle multiple variables and large grids.

problem Scalability and handling of multiple variables in geostatistical simulation.
method Uses Sinkhorn optimal transport with sparse matcher and FFT-MA Gaussian backbone.
result MST-Direct reproduces joint distribution with zero histogram error and accurately preserves spatial correlation.

We propose a new splitting criterion for a meta-learning approach to multiclass classifier design that adaptively merges the classes into a tree-structured hierarchy of increasingly difficult binary classification problems. The classification tree is constructed from empirical estimates of the Henze-Penrose bounds on t…

2017-11-09abs ↗pdf ↗

MSTGD optimizes gradient descent with stratified sampling for faster convergence.

problem Fluctuation in gradient expectation and variance between iterations.
method Memory Stochastic Stratified Gradient Descent (MSTGD) with stratified sampling and variance reduction.
result MSTGD achieves an exponential convergence rate independent of dataset size and batch size.

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 as well as for four distinct currency groups (major, liquid, less liquid and no…

2008-09-02abs ↗pdf ↗

Previously, we proposed a physically inspired rule to organize the data points in a sparse yet effective structure, called the in-tree (IT) graph, which is able to capture a wide class of underlying cluster structures in the datasets, especially for the density-based datasets. Although there are some redundant edges or…

2015-06-19abs ↗pdf ↗

Study examines financial market structure changes during the COVID-19 crash using a novel MI approach.

problem Analyzing nonlinear dependencies among major stocks during market crashes.
method Conditional p-threshold mutual information (MI) and Minimum Spanning Tree (MST) framework.
result Financial networks become more integrated during crashes, with increased periphery vulnerability.

Stock price movement reveals complex interdependencies that are simplified through linear correlation.

problem Exploring the spectral dynamics of the Indonesian capital market using structural network representations.
method Combining three dependency estimators (Pearson, MI adaptive binning, and MI-kNN) with two graph filtering schemes (MST and PMFG) and four community decoders.
result MI adaptive binning is shown to be more proportional than kNN for detecting residual information.

In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTM-CNNs which benefits from both word- and …

2017-01-04abs ↗pdf ↗

Study on cryptocurrency market correlations at various time scales.

problem Understanding the hierarchical structure of cryptocurrency market dynamics.
method Analysis of MST and TMFG for 25 liquid cryptocurrencies at different time horizons.
result Cryptocurrency market correlations decrease with finer time scales and show a growing hierarchical structure with coarser scales.

This paper proposes a geometric estimator of dependency between a pair of multivariate samples. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples. This estimator converges to a quantity that we call the geometric mutual inf…

2019-05-21abs ↗pdf ↗

The paper proposes a new portfolio allocation method combining RMT and machine learning.

problem Optimal allocation instability in high-dimensional portfolios.
method Combines Random Matrix Theory covariance estimators with Nested Clustered Optimization.
result The modified NCO algorithm achieves stable allocations without risky short positions.