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.
A new classification method based on Minimum Spanning Trees
We investigate the time series of the degree of minimum spanning trees obtained by using a correlation based clustering procedure which is starting from (i) asset return and (ii) volatility time series. The minimum spanning tree is obtained at different times by computing correlation among time series over a time windo…
Optimal coupling among random vectors with known statistics and correlation structure found using minimum spanning tree over measure-valued vertices.
A new hierarchical clustering method selects representative points from sub-minimum-spanning-trees.
Mutual information minimum spanning trees are used to explore nonlinear dependencies on Brazilian equity network in the periods from June/01/2015 to January/26/2016, in which Brazil was under the government of President Dilma Rousseff, and from January/27/2016 to September/08/2016 which includes the government transiti…
Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.
We investigate the problem of nodes clustering under privacy constraints when representing a dataset as a graph. Our contribution is threefold. First we formally define the concept of differential privacy for structured databases such as graphs, and give an alternative definition based on a new neighborhood notion betw…
Lumbermark clusters data robustly, slicing limbs of mutual reachability trees.
One-class classifiers are trained with target class only samples. Intuitively, their conservative modelling of the class description may benefit classical classification tasks where classes are difficult to separate due to overlapping and data imbalance. In this work, three methods are proposed which leverage on the co…
We investigate hierarchical structure in various complex systems according to Minimum Spanning Tree methods. Firstly, we investigate stock markets where the graphis obtained from the matrix of correlations coefficient computed between all pairs of assets by considering the synchronous time evolution of the difference o…
OCmst detects anomalies using CNN features and MSTs.
MSTs provide a fast and meaningful clustering method in low-dimensional data.
Optimizes balanced treatment assignment for experiments.
This paper is part of the research on the interlinkages between insurers and their contribution to systemic risk on the insurance market. Its main purpose is to present the results of the analysis of linkage dynamics and systemic risk in the European insurance sector which are obtained using correlation networks. These…
This paper uses rank correlation methods to construct MSTs from financial returns, finding them more stable and robust.
This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered a…
Based on a recently proposed -dependent detrended cross-correlation coefficient , we generalize the concept of minimum spanning tree (MST) by introducing a family of -dependent minimum spanning trees (MST) that are selective to cross-correlations between different fluctuation amplitudes and different time…
We compare three network portfolio selection methods; hierarchical clustering trees, minimum spanning trees and neighbor-Nets, with random and industry group selection methods on twelve years of data from the 30 Dow Jones Industrial Average stocks from 2001 to 2013 for very small private investor sized portfolios. We f…
In this paper we use wavelet concepts to show that correlation coefficient between two financial data's is not constant but varies with scale from high correlation value to strongly anti-correlation value This studies is important because correlation coefficient is used to quantify degree of independence between two va…
A new classifier improves one-class predictions on unevenly sampled data.
Study on cryptocurrency market correlations at various time scales.
In this paper, we propose a design methodology for one-class classifiers using an ensemble-of-classifiers approach. The objective is to select the best structures created during the training phase using an ensemble of spanning trees. It takes the best classifier, partitioning the area near a pattern into sub-…
In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesnt require to set in advance …
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 partial correlations with market indices, multidimensional scaling and minimum s…
Using transfer entropy, we observed the strength and direction of information flow between stock indices. We uncovered that the biggest source of information flow is America. In contrast, the Asia/Pacific region the biggest is receives the most information. According to the minimum spanning tree, the GSPC is located at…
We use the correlation matrix of stocks returns in order to create maps of the São Paulo Stock Exchange (BM&F-Bovespa), Brazil's main stock exchange. The data reffer to the year 2010, and the correlations between stock returns lead to the construction of a minimum spanning tree and of asset graphs with a variety of thr…
We present an integrated approach for structure and parameter estimation in latent tree graphical models. Our overall approach follows a "divide-and-conquer" strategy that learns models over small groups of variables and iteratively merges onto a global solution. The structure learning involves combinatorial operations…
Sharp bounds for spanning tree entropy in planar lattices.
The correlation coefficient between stocks depends on price history and includes information on hierarchical structure in financial markets. It is useful for portfolio selection and estimation of risk. I introduce the Life Time of Correlation between stocks prices to know how far we should investigate the price history…
The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …
Alexander polynomial equals spanning tree count at t=1.
Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two nodes, or the expected weight of a minimum spanning tree of the graph, etc. These sta…
This paper shows neural networks can solve complex graph problems efficiently.
Graph regularized autoencoder improves anomaly detection performance.
New spanning tree model connects knot homology, s-invariant, and exotic discs.
For a spanning tree T of a connected graph G and for a labelling φ: E(T) \rightarrow {+, -}, φis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e \in E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph ha…
Standard agglomerative clustering suggests establishing a new reliable linkage at every step. However, in order to provide adaptive, density-consistent and flexible solutions, we study extracting all the reliable linkages at each step, instead of the smallest one. Such a strategy can be applied with all common criteria…
We use a spanning tree model to prove a result of E. S. Lee on the support of Khovanov homology of alternating knots.
The development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm that simulates stochastic flows on a network of sample similarities to detect the structural organization of clusters in the data, but it has n…
Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can be solved optimally by a greedy method. In this work, we study a learning variant of these problems, where the model of the problem is unknown and has to be learned by interacting repeatedly with the environment in the ba…
There is intense interest in understanding the stochastic and dynamical properties of the global Foreign Exchange (FX) market, whose daily transactions exceed one trillion US dollars. This is a formidable task since the FX market is characterized by a web of fluctuating exchange rates, with subtle inter-dependencies wh…
In this study, we establish a network structure of the Korean stock market, one of the emerging markets, with its minimum spanning tree through the correlation matrix. Base on this analysis, it is found that the Korean stock market doesn't form the clusters of the business sectors or of the industry categories. When th…
In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's backbone. We discuss the role of large-sized countries (strongest economies) in…
Statistical uncertainty of different filtration techniques for market network analysis is studied. Two measures of statistical uncertainty are discussed. One is based on conditional risk for multiple decision statistical procedures and another one is based on average fraction of errors. It is shown that for some import…
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram , there is an associated ribbon graph whose quasi-trees correspond bijectively to …
We investigated the network structures of the Japanese stock market through the minimum spanning tree. We defined grouping coefficient to test the validity of conventional grouping by industrial categories, and found a decreasing in trend for the coefficient. This phenomenon supports the increasing external influences …
We iterate Manolescu's unoriented skein exact triangle in knot Floer homology with coefficients in the field of rational functions over . The result is a spectral sequence which converges to a stabilized version of delta-graded knot Floer homology. The page of this spectral sequence …
We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…