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

Trend · papers per month

54109163217 · Jun 202019922001200920172026
48 results for integral matrices

The study explores congruence subgroups of braid groups and their quotients.

problem Understanding the structure of congruence subgroups of braid groups.
method Utilizing the integral Burau representation and results from integral matrices, the study examines quotients of these subgroups.
result Findings of quotients that are not isomorphic to symmetric groups.

We construct a general procedure to extract the exclusive Racah matrices S and \bar S from the inclusive 3-strand mixing matrices by the evolution method and apply it to the first simple representations R =[1], [2], [3] and [2,2]. The matrices S and \bar S relate respectively the maps (R\otimes R)\otimes \bar R\longrig…

2016-05-16abs ↗pdf ↗

Advances in molecular "omics'" technologies have motivated new methodology for the integration of multiple sources of high-content biomedical data. However, most statistical methods for integrating multiple data matrices only consider data shared vertically (one cohort on multiple platforms) or horizontally (different …

2019-06-09abs ↗pdf ↗

The paper uses Betti curves to confirm hyperbolic geometry in brain, climate, and financial networks.

problem Confirming the curvature of real-world networks using topology.
method Using Betti curves and integral Betti signatures derived from Persistent Homology to distinguish different geometric matrices.
result Integral Betti signatures effectively distinguish Euclidean, spherical, and hyperbolic geometric matrices.

Proposes BONMI for integrating noisy matrices from multi-source data.

problem Integrating noisy matrices from multi-source data with block-wise missingness.
method Exploits orthogonal Procrustes problem to align eigenspaces and completes missing blocks.
result Statistical rate for eigenspace of underlying matrix comparable to independently missing assumption.

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.

Affine manifolds are called integral if there is an atlas such that all transition maps are affine transformations with integer matrices of linear parts. In this paper we describe all complete integral affine structures on compact three-dimensional manifolds up to a finite-sheeted covering. Also a complete list of inte…

2018-12-23abs ↗pdf ↗

Paper provides unbiased spectral moment estimates from finite data.

problem Challenges in estimating spectral moments from limited data.
method Dynamic programming approach to estimate spectral moments of kernel integral operator.
result Demonstrates consistency with theoretical spectra and practical utility in neural networks.

Paper constructs super integrable systems on color Lie algebra.

problem Super integrable systems on color Lie algebra.
method Using non-isospectral problems with matrices from color Lie algebra sp1(6)\mathfrak{sp}_{1}(6), constructing (1+1)- and (2+1)-dimensional systems.
result Super integrable systems and their Hamiltonian structures constructed on color Lie algebra sp1(6)\mathfrak{sp}_{1}(6).

Kernel methods summarize and integrate posterior similarity matrices from Bayesian clustering.

problem Summarizing and integrating posterior similarity matrices from Bayesian clustering.
method Positive semi-definite PSMs, kernel matrices, kernel methods, combining kernels.
result Kernel methods effectively summarize and integrate posterior similarity matrices.

In their precedent work, the authors constructed closed oriented hyperbolic surfaces with pseudo-Anosov homeomorphisms from certain class of integral matrices. In this paper, we present a very simple algorithm to compute the Teichmueller polynomial corresponding to those surface homeomorphisms by first constructing an …

2017-03-27abs ↗pdf ↗

This paper analyzes AJIVE for estimating shared subspace across multiple datasets, revealing its strengths and limitations.

problem Estimating shared subspace across multiple datasets with varying degrees of misalignment.
method Angle-based Joint and Individual Variation Explained (AJIVE) method, a two-stage spectral approach.
result AJIVE's performance in high signal-to-noise ratio (SNR) regimes and its non-diminishing error in low-SNR settings.

Study of discrete period matrices on embedded graphs, relating to Riemann surfaces.

problem Understanding discrete conformal structures on surfaces via period matrices.
method Combinatorial interpretation of period matrices, using homological quasi-trees and Laplacian determinants.
result Derived a combinatorial analogue of the Weil-Petersson potential and related it to homological quasi-trees.

Coupled nonlinear integrable systems are generated from usual zero curvature equation. The relevant Maurer-Cartan forms are constructed by combining suitably chosen matrices (nilpotent, Hadamard, idempotent and k-idempotent) and Lie algebraic elements via Kronecker product. In each case a closure type property among th…

2017-09-22abs ↗pdf ↗

Paper introduces MSA for weakly supervised covariance alignment in MEG signals.

problem Limited labeled signals in target datasets for MEG applications.
method Mixing model Stiefel Adaptation (MSA) leveraging unlabeled data.
result MSA outperforms recent methods in brain-age regression with MEG signals.

Learning by integrating multiple heterogeneous data sources is a common requirement in many tasks. Collective Matrix Factorization (CMF) is a technique to learn shared latent representations from arbitrary collections of matrices. It can be used to simultaneously complete one or more matrices, for predicting the unknow…

2018-11-28abs ↗pdf ↗

Study of correlated Wigner matrices with BBP transitions.

problem Understanding spectral transitions in correlated Wigner matrices.
method Analyzes a Wigner-type matrix with row/column correlations, decomposes into bulk and outliers, and uses integral operators to model transitions.
result Correlated Wigner matrices exhibit multiple BBP transitions at critical points.

New matrix reveals cluster info in sparse directed graphs.

problem Analyzing cluster information in directed graphs.
method Proposed complex non-backtracking matrix integrating Hermitian adjacency matrix and non-backtracking matrix properties.
result The complex non-backtracking matrix holds cluster information, especially for sparse directed graphs.

DiffeoCFM efficiently generates realistic brain connectivity matrices using pullback metrics.

problem Generating realistic brain connectivity matrices for population heterogeneity analysis.
method Conditional flow matching on matrix manifolds via pullback metrics induced by global diffeomorphisms.
result DiffeoCFM achieves state-of-the-art performance on large-scale fMRI and EEG datasets.

Paper introduces a new anomaly detection framework combining density estimation and deep learning.

problem Detecting anomalies in data with varying dimensions.
method Two versions: shallow approach using adaptive Fourier features and density matrices; deep approach using autoencoder.
result Both methods achieve comparable or superior performance compared to state-of-the-art methods.

Study optimizes shared singular subspace estimation from noisy matrices.

problem Estimating shared singular subspaces across multiple noisy matrices.
method Low-rank matrix denoising framework with Stack-SVD and novel estimators.
result Stack-SVD achieves minimax rate-optimality for identical shared subspaces, and novel estimators for partial sharing.

We prove in this paper that the weighted volume of the set of integral transportation matrices between two integral histograms r and c of equal sum is a positive definite kernel of r and c when the set of considered weights forms a positive definite matrix. The computation of this quantity, despite being the subject of…

2012-09-12abs ↗pdf ↗

Researchers approximate partition functions on Riemannian spaces in the large N limit.

problem Computing normalization factors (partition functions) on Riemannian symmetric spaces is challenging.
method Approximation techniques in the large N limit, including saddle-point equations.
result Formulas for leading order terms in the large N limit of SPD matrices and related spaces.

New unoriented algebraic concordance group defined using mock Seifert matrices.

problem Understanding unoriented algebraic concordance of knots in thickened surfaces.
method Introducing mock Seifert matrices and using them to define unoriented algebraic concordance.
result The unoriented algebraic concordance group is abelian and infinitely generated.

Given two data matrices XX and YY, sparse canonical correlation analysis (SCCA) is to seek two sparse canonical vectors uu and vv to maximize the correlation between XuXu and YvYv. However, classical and sparse CCA models consider the contribution of all the samples of data matrices and thus cannot identify an unde…

2017-10-13abs ↗pdf ↗

Let T be the nilpotent group of 4 x 4 real upper triangular matrices. In this note we show that the Euler equations of certain left-invariant riemannian metrics on T have a horseshoe. We also show, with the aid of a numerical computation of a Melnikov-type integral, that the Euler equations of the sub-riemannian Carnot…

2007-09-28abs ↗pdf ↗

We consider numerical integrators of ODEs on homogeneous spaces (spheres, affine spaces, hyperbolic spaces). Homogeneous spaces are equipped with a built-in symmetry. A numerical integrator respects this symmetry if it is equivariant. One obtains homogeneous space integrators by combining a Lie group integrator with an…

2014-02-27abs ↗pdf ↗

New method reduces memory usage for Bayesian inverse problems on large grids.

problem Solving large-scale linear inverse problems with Gaussian process priors.
method Implicit representation of posterior covariance matrices, sequential disintegrations of Gaussian measures.
result Significant reduction in uncertainty for high-density regions estimation.

We introduce a matrix representation of a chord on a tangle which leads us to representing tangle chord diagrams as stacks of matrices that we call books. We show that band sum moves, Reidemeister moves as well as orientation changes are implemented on \widetilde{Z}_f - a framed link invariant constructed from the Kont…

2010-10-14abs ↗pdf ↗

Kernel density matrices simplify probabilistic deep learning.

problem Representing joint probability distributions of continuous and discrete variables.
method Extending density matrices to a reproducing kernel Hilbert space.
result Versatile representation for marginal and joint probability distributions.

Deep model integrates MRI and DTI for autism severity prediction.

problem Predicting spectrum-level deficits in autism using multimodal brain imaging.
method Generative deep-learning framework combining rs-fMRI and DTI data.
result Hybrid model outperforms existing methods in predicting autism severity.

The notion of a (stably) decomposable fiber bundle is introduced. In low dimensions, for torus fiber bundles over a circle the notion translates into a property of elements of the special linear group of integral matrices. We give a complete characterization of the stably decomposable torus fiber bundle of fiber-dimens…

2016-07-25abs ↗pdf ↗

A new geometric framework embeds correlation matrices into Euclidean space for scalable brain network analysis.

problem Inefficient and unstable analysis of functional brain networks in high-dimensional contexts.
method Diffeomorphic transformations to embed correlation matrices into Euclidean space, preserving manifold properties.
result Improved computational speed and enhanced accuracy compared to conventional manifold-based approaches.