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,695 papers · 148 categories

Trend · papers per month

3673109145 · Jun 202019922001200920172026
48 results for thresholding correlations

The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.

problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

problem Recovering hidden vertex correspondences in partially correlated graphs.
method Proposed partially correlated Erdős-Rényi graphs model; information-theoretic thresholds; correlated functional digraphs.
result Optimal rates for partial and exact recovery of vertex correspondences.

Based on the daily data of American and Chinese stock markets, the dynamic behavior of a financial network with static and dynamic thresholds is investigated. Compared with the static threshold, the dynamic threshold suppresses the large fluctuation induced by the cross-correlation of individual stock prices, and leads…

2010-02-18abs ↗pdf ↗

We study graph matching with correlated Gaussian features and find thresholds for exact recovery.

problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.

The paper develops a test for independence of selected Gaussian variables after thresholding correlations.

problem Testing independence of selected Gaussian variables after thresholding correlations.
method The approach involves conditioning on the selection event and using a new characterization of the conditioning event in terms of canonical correlation.
result The proposed test has higher power than a naive approach that ignores selection effects.

Optimizes search times by resetting agents when a threshold is reached.

problem Improving search efficiency in systems with thresholds.
method Develops a framework for correlated stochastic processes with threshold resetting.
result Optimal resetting can prevent larger losses and is applicable to various stochastic systems.

This paper treats the problem of screening for variables with high correlations in high dimensional data in which there can be many fewer samples than variables. We focus on threshold-based correlation screening methods for three related applications: screening for variables with large correlations within a single trea…

2011-02-06abs ↗pdf ↗

New algorithm achieves almost exact graph matching in almost quadratic time.

problem Graph matching under correlated Erdős-Rényi models.
method Rank-based graph matching using local tree correlation tests.
result Achieves almost exact recovery in almost quadratic time complexity.

A new algorithm infers causal networks from data using topological thresholds.

problem Inferring causal networks from data.
method Two methods for determining topological thresholds: one to leave no disconnected nodes, the other to find a causal large connected component.
result The novel algorithm is faster and more accurate than the PC algorithm.

Detecting edge correlation between two graphs sharpens a threshold based on densest subgraph.

problem Detecting edge correlation between two Erdős-Rényi graphs.
method Formulated as a hypothesis testing problem, connecting to densest subgraph detection.
result Sharp information-theoretic threshold established for edge correlation detection.

This study optimizes multi-modal learning thresholds and algorithms in high dimensions.

problem Optimizing multi-modal learning performance in high-dimensional data.
method Analytical quantification and derivation of AMP algorithm with state evolution analysis.
result Bayes-optimal performance and recovery thresholds derived for multi-modal data.

Sparse GCA finds linear relationships in multiple datasets, using gradient descent.

problem Finding linear relationships across multiple datasets with sparse loading vectors.
method Formulated as generalized eigenvalue problems, used a thresholded gradient descent algorithm.
result Proposed algorithm yields tight estimation error bounds and demonstrates effectiveness on synthetic datasets.

Exact simulation of correlated binary outcomes using PMF constraints and linear programming.

problem Simulating dependent Bernoulli outcomes with specific means and correlations.
method Formulate the problem over the joint Bernoulli PMF, impose constraints, and solve as a linear program. Use convex-hull characterization and truncated-moment completion scheme for feasibility and simulation.
result Exact simulation framework for correlated binary outcomes, providing a convex-hull characterization and truncated-moment completion scheme.

Unified framework for shrinkage, thresholding, and regularization in normal mean estimation and linear regression.

problem Estimation of normal mean in multivariate settings with correlated observations.
method Approximate risk minimization over a functional class of shrinkage-thresholding rules.
result Unified estimator NOMAD for shrinkage, thresholding, and regularization.

A class of heterogeneous agent models is investigated where investors switch trading position whenever their motivation to do so exceeds some critical threshold. These motivations can be psychological in nature or reflect behaviour suggested by the efficient market hypothesis (EMH). By introducing different propensitie…

2006-07-31abs ↗pdf ↗

This study examined how the correlation and network structure of 30 global indices and 145 local Korean indices belonging to the KOSPI 200 have changed during the 13-year period, 2000-2012. The correlations among the indices were calculated. The results showed that although the average correlations of the global indice…

2014-02-07abs ↗pdf ↗

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two en…

2015-02-11abs ↗pdf ↗

The paper examines how small positive dependence can lead to correlated tail risks.

problem Understanding the impact of dependence uncertainty on tail risk measures.
method Introducing a regular dependence measure and analyzing the aggregation of risks.
result Small positive dependence can result in perfectly correlated tail risks.

The paper discusses thresholds and bounds for accuracy in binary classification systems.

problem The accuracy of binary classification systems and its dependence on prevalence.
method Analyzing the precision-prevalence curve and negative predictive value-prevalence curve to find thresholds and bounds.
result Thresholds (φeφ_e and φnφ_n) bound various accuracy metrics (Fβ, F1, FM, MCC) and the ratio of maximum accuracy to prevalence.

We apply a utility-based method to obtain the value of a finite-time investment opportunity when the underlying real asset is not perfectly correlated to a traded financial asset. Using a discrete-time algorithm to calculate the indifference price for this type of real option, we present numerical examples for the corr…

2006-04-13abs ↗pdf ↗

Study reveals limits of PLS in multi-modal learning with correlated signals.

problem Understanding PLS performance in multi-modal learning with correlated signals.
method Random matrix theory analysis of spiked cross-covariance models.
result Identifies SNR and correlation regimes where PLS fails to recover any signal.

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…

2011-07-21abs ↗pdf ↗

Study reveals efficient recovery of multi-modal signals via Bayesian methods and sequential learning.

problem Recovering multiple high-dimensional signals from correlated modalities.
method Bayesian Approximate Message Passing and Sequential Curriculum Learning.
result Sequential learning strategy optimally recovers weak signals in multi-modal settings.

We study the return interval ττ between price volatilities that are above a certain threshold qq for 31 intraday datasets, including the Standard & Poor's 500 index and the 30 stocks that form the Dow Jones Industrial index. For different threshold qq, the probability density function Pq(τ)P_q(τ) scales with the mean i…

2005-11-11abs ↗pdf ↗

This paper resolves the all-or-nothing phase transition in graph matching.

problem Recovering vertex correspondence between edge-correlated random graphs.
method Analysis of mutual information, truncated second-moment computation, and maximum likelihood estimator.
result Sharp thresholds for correct matching in both dense and sparse graphs.

Study connects database alignment and planted matching using Gaussian features.

problem Identify matching between correlated user features in anonymized databases.
method Derived results for database alignment and planted matching, showing connections and thresholds.
result Performance thresholds for database alignment converge to planted matching when feature dimensionality is sufficiently high.

Paper proves computational hardness for graph matching and detection problems.

problem Computational hardness for graph matching and detection problems in correlated random graphs.
method Algorithmic contiguity and low-degree advantage bounds.
result No efficient algorithms exist for certain graph matching and detection problems.

Study detects signal in financial stock correlations using phase-ordering kinetics.

problem Detecting meaningful signals in financial stock return correlations.
method Stochastic field theory model to establish a detection threshold.
result Detection of a signal in the largest eigenvalues of the stock return correlation matrix.

We consider the community detection problem in sparse random hypergraphs. Angelini et al. (2015) conjectured the existence of a sharp threshold on model parameters for community detection in sparse hypergraphs generated by a hypergraph stochastic block model. We solve the positive part of the conjecture for the case of…

2019-04-11abs ↗pdf ↗

First passage models, where corporate assets undergo correlated random walks and a company defaults if its assets fall below a threshold provide an attractive framework for modeling the default process. Typical one year default correlations are small, i.e., of order a few percent, but nonetheless including correlations…

2008-12-10abs ↗pdf ↗

We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study the parameter estimation problem under such one-parameter models. We demonstrate…

2017-12-27abs ↗pdf ↗

Using data from world stock exchange indices prior to and during periods of global financial crises, clusters and networks of indices are built for different thresholds and diverse periods of time, so that it is then possible to analyze how clusters are formed according to correlations among indices and how they evolve…

2011-11-22abs ↗pdf ↗