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.

169,341 papers · 148 categories

Trend · papers per month

3978116155 · Jun 202019922001200920182026
48 results for degree correlation

Efficiently matches random graphs with inhomogeneous edge probabilities.

problem Matching latent vertex correspondence between two correlated random graphs with inhomogeneous edge probabilities.
method Inspired by Ding et al. (2021), an efficient matching algorithm is developed with conditions on minimal average degree and minimal correlation.
result An efficient matching algorithm is obtained as long as the minimal average degree is at least Ω(log2n)Ω(\log^{2} n) and the minimal correlation is at least 1O(log2n)1 - O(\log^{-2} n).

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 ↗

Algorithm aligns correlated Erdős-Rényi graphs efficiently.

problem Graph alignment in correlated Erdős-Rényi graphs.
method A canonical labeling algorithm with two steps: degree-based matching and bipartite graph alignment.
result The algorithm succeeds in aligning correlated Erdős-Rényi graphs in a specific time complexity region.

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.

The paper explores statistical limits for detecting correlation in tree structures.

problem Detecting correlation between two tree structures.
method Investigates conditions for existence of one-sided tests in the limit of large tree depth.
result Identifies a phase transition at correlation parameter s=αs = \sqrt{α}, where tests exist for s>αs > \sqrt{α}.

New hierarchical model improves on standard practice for high-dimensional data.

problem Poor statistical performance in high-dimensional hierarchical models.
method Model effects as exchangeable across covariates and correlated across datasets.
result Empirical Bayes estimator outperforms classic approach in high-dimensional settings.

Among the proposed network models, the hidden variable (or good get richer) one is particularly interesting, even if an explicit empirical test of its hypotheses has not yet been performed on a real network. Here we provide the first empirical test of this mechanism on the world trade web, the network defined by the tr…

2004-03-01abs ↗pdf ↗

Spectral denoising recovers meaningful network structure from noisy financial correlations.

problem Noise in empirical correlation matrices from financial returns obscures genuine interactions.
method Spectral decomposition to separate structured and random components.
result Structured networks derived from 10-16 eigenmodes exhibit stronger core-periphery organization and scale-free degree distributions.

We describe a method to determine the eigenvalue density of empirical covariance matrix in the presence of correlations between samples. This is a straightforward generalization of the method developed earlier by the authors for uncorrelated samples. The method allows for exact determination of the experimental spectru…

2005-08-19abs ↗pdf ↗

Deep learning explained through spectral filtering of hierarchical features.

problem Understanding how deep neural networks learn useful representations from data.
method Neural Low-Degree Filtering (Neural LoFi) as a stylized limit of gradient-based training.
result Predicts how representations are selected layer by layer and explains emergence of concepts.

We consider a model of contagion in financial networks recently introduced in the literature, and we characterize the effect of a few features empirically observed in real networks on the stability of the system. Notably, we consider the effect of heterogeneous degree distributions, heterogeneous balance sheet size and…

2011-09-06abs ↗pdf ↗

Paper analyzes misclassification in binary stochastic block model with correlated degrees.

problem Sharp recovery thresholds for cluster recovery in degree-correlated stochastic block model.
method Connects cluster recovery to tree reconstruction problems, analyzes density evolution of belief propagation on Gaussian approximated trees.
result Minimum fraction of misclassified vertices on average is given by Q(v)Q(\sqrt{v^*}) where vv^* is a fixed point of a specific equation.

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.

Study finds multifractal cross-correlations between agricultural markets and external uncertainties.

problem Investigating relationships between agricultural spot markets and external uncertainties.
method Multifractal detrending moving-average cross-correlation analysis (MF-X-DMA).
result Maize exhibits intrinsic joint multifractality with all uncertainty proxies.

Randomly selected factors preserve correlation structure in high-dimensional data.

problem Preserving correlation structure in high-dimensional data.
method Random projection method to select factors, preserving covariance matrix and time-series accuracy.
result Randomly selected factors accurately represent time-series and their cross-correlations.

Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.

problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.

Weak correlations explain linear dynamics in deep learning models.

problem Understanding the linear structure in gradient-based learning algorithms.
method Characterization of weak correlations between derivatives and parameters.
result Weak correlations are the underlying principle for linearization in deep learning models.

CAKD framework optimizes knowledge transfer by focusing on influential components of distillation.

problem Balancing and optimizing knowledge transfer in distillation models.
method Decouple KL divergence into BCD, SCD, and WCD; prioritize influential components.
result CAKD framework consistently outperforms baseline across diverse models and datasets.

Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. In this paper, we introduce new algorithm of visibility, "cross-visibility", which reveals the conjugation of two coupled time series. The correspondence between the two time series is mappe…

2013-01-06abs ↗pdf ↗

Study finds nonlinear relationship between stock correlation and multiscaling indicator.

problem Understanding the relationship between stock correlation and multiscaling in financial markets.
method Investigated the relationship between an indicator of multiscaling and stock correlation, considering capitalization and kurtosis.
result Observed a robust stylized fact of nonlinear dependence between multiscaling indicator and stock correlation across different markets.

Novel methods transform correlated neutral vectors into independent variables.

problem Decorrelating correlated neutral vector variables that are not multivariate Gaussian distributed.
method Serial and parallel nonlinear transformations to achieve mutual independence.
result Highly negatively correlated neutral vectors can be transformed into mutually independent scalar variables.

Many models of market dynamics make use of the idea of conservative wealth exchanges among economic agents. A few years ago an exchange model using extremal dynamics was developed and a very interesting result was obtained: a self-generated minimum wealth or poverty line. On the other hand, the wealth distribution exhi…

2012-12-05abs ↗pdf ↗

Alexander polynomial degree correlates with knot defect, proving conjecture for defect zero.

problem Characterizing knot polynomials and their defects.
method Analyzing differential expansions and degree in q±2q^{\pm 2} of Alexander polynomials.
result Proved Alexander polynomial degree correlates with knot defect, especially for defect zero.

Paper proposes a new descriptor for early trajectory characterization in matrix iterations.

problem Comparing early behavior of high-dimensional trajectories in nonlinear matrix iterations.
method Develops a two-channel fuzzy coordinate system using F-transform for compact representation.
result The descriptor achieves high R^2 values (mean = 0.6480) in approximating convergence lengths.

New insights into ridge regression with correlated data, improving risk prediction.

problem Understanding and predicting risk in ridge regression with correlated samples.
method Random matrix theory and free probability for asymptotic analysis; modified GCV estimator (CorrGCV) for unbiased prediction.
result GCV estimator fails for out-of-sample risk with correlated data; CorrGCV provides an unbiased estimator.

Researchers prove it's impossible to partially recover graph alignments in certain conditions.

problem Recovering vertex correspondence between two random graphs with correlated edges.
method Used the probabilistic method to build automorphisms between tree components of a subcritical Erdös-Rényi graph.
result Proved an impossibility result for partial recovery in the sparse regime with constant average degree and correlation.