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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for block-structured Wigner model

Researchers found the Wigner derivative and its inverse are equal for spherical tetrahedra.

problem Computing the relationship between dihedral angles and edge lengths in tetrahedra.
method Computed the Wigner derivative and its inverse for spherical tetrahedra.
result The Wigner derivative and its inverse are equal for spherical tetrahedra.

Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks have a power-law dist…

2015-07-10abs ↗pdf ↗

A novel method computes Wigner kernels for atomic environments, achieving state-of-the-art accuracy.

problem Efficiently describing local atomic environments in materials science.
method Computes fully equivariant and body-ordered kernels iteratively, independent of basis.
result Achieves state-of-the-art accuracy on the QM9 benchmark dataset.

We show that, for each alpha in the interval (-1,1), the only Riemannian metrics on the space of positive definite matrices for which the alpha and -alpha-connections are mutually dual are matrix multiples fo the Wigner-Yanase-Dyson metric. If we further impose that the metric be monotone, then this set is reduced to s…

2002-12-05abs ↗pdf ↗

Study detects signals in spiked Wigner models using log likelihood ratio.

problem Detecting signals in rank-one spiked Wigner models with non-Gaussian noise.
method Proved asymptotic normality of log likelihood ratio and computed error thresholds.
result Optimal signal-to-noise ratio threshold for reliable detection.

Wigner's theorem asserts that an isometric (probability conserving) transformation on a quantum state space must be generated by a Hamiltonian that is Hermitian. It is shown that when the Hermiticity condition on the Hamiltonian is relaxed, we obtain the following complex generalisation of Wigner's theorem: a holomorph…

2013-05-03abs ↗pdf ↗

Recently it has become popular to learn sparse Gaussian graphical models (GGMs) by imposing l1 or group l1,2 penalties on the elements of the precision matrix. Thispenalized likelihood approach results in a tractable convex optimization problem. In this paper, we reinterpret these results as performing MAP estimation u…

2012-05-09abs ↗pdf ↗

Study on eigenvalue distribution of correlated time series deforming the semi-circle law.

problem Eigenvalue distribution of correlated time series differs from the semi-circle law.
method Analysis of Wigner random matrix with temporal correlation.
result Eigenvalue distribution converges to a deformed semi-circle law with longer tail and higher peak.

Extends Wigner's representation to study super hyperbolic geometry.

problem Understanding geometry in super hyperbolic three-space.
method Extended Wigner's representation of the Lorentz group to OSp_C(1|2) and applied to Minkowski (3,1|4)-dimensional super space.
result Proof of divergence of the volume of a typical ideal tetrahedron in super hyperbolic three-space.

Study provides selective inference method for latent block models.

problem Challenges in constructing a test on a block structure selected by clustering algorithms.
method Developed a selective inference method for latent block models using squared residue minimization and simulated annealing.
result Proposed tests effectively handle selective bias in block structures compared to naive tests.

We consider the weak detection problem in a rank-one spiked Wigner data matrix where the signal-to-noise ratio is small so that reliable detection is impossible. We propose a hypothesis test on the presence of the signal by utilizing the linear spectral statistics of the data matrix. The test is data-driven and does no…

2018-09-28abs ↗pdf ↗

Training large machine learning (ML) models with many variables or parameters can take a long time if one employs sequential procedures even with stochastic updates. A natural solution is to turn to distributed computing on a cluster; however, naive, unstructured parallelization of ML algorithms does not usually lead t…

2013-12-19abs ↗pdf ↗

Study optimal algorithms for recovering signals through inhomogeneous low-rank channels.

problem Recovering signals through an inhomogeneous low-rank matrix channel.
method Derive and analyze an approximate message-passing algorithm (AMP) and a spectral method.
result The AMP iteration matches the conjectured optimal computational phase transition.

PPM improves graph matching for correlated Gaussian Wigner models with high probability.

problem Graph matching in the Correlated Gaussian Wigner model with edge correlations.
method Seeded projected power method (PPM) for iterative improvement of initial partial matches.
result PPM recovers ground-truth matching with high probability in O(log n) iterations if seed is close enough.

Affine λλ-equidistants of convex polygons with parallel opposite sides have applications to isoperimetric inequalities.

problem Reconstruction and area estimates for affine λλ-equidistants of convex polygons with parallel opposite sides.
method Using Wigner caustics and centre symmetry sets.
result Proving a discrete version of the improved isoperimetric inequality.

On the manifold of positive definite matrices, we investigate the existence of pairs of flat affine connections, dual with respect to a given monotone metric. The connections are defined either using the αα-embeddings and finding the duals with respect to the metric, or by means of contrast functionals. We show that i…

2003-07-28abs ↗pdf ↗

Extends particle classification to curved space-times using groupoids.

problem Classifying elementary particles in curved space-time.
method Developed a new definition of elementary particles as irreducible projective representations of kinematical groupoids, extending Wigner's program.
result Classification of elementary particles valid for a wide range of space-times, including new massless particles in magnetic-like backgrounds.

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.

We study the statistical decision process of detecting the signal from a `signal+noise' type matrix model with an additive Wigner noise. We propose a hypothesis test based on the linear spectral statistics of the data matrix, which does not depend on the distribution of the signal or the noise. The test is optimal unde…

2020-01-16abs ↗pdf ↗

Paper develops new method for detecting latent structure in large symmetric data matrices.

problem Testing for latent structure in large symmetric data matrices.
method Introduces Wilcoxon--Wigner random matrices based on normalized rank statistics.
result Establishes asymptotic Gaussian fluctuations for leading eigenvalue and eigenvector of Wilcoxon--Wigner matrices.

Study on complexity of random polynomials with deterministic spikes, identifying phase transitions.

problem Complexity of random Gaussian polynomials with deterministic spikes on a sphere.
method Variational formulas, Kac-Rice formula, determinant asymptotics of finite-rank perturbation of Gaussian Wigner matrices.
result Identification of a topological phase transition in the complexity function.

New estimators reduce computation for Kendall's tau and conditional Kendall's tau matrices under structural assumptions.

problem Efficient estimation of Kendall's tau and conditional Kendall's tau matrices for large dimensions.
method Averaging pairwise estimates over blocks or conditional estimates, exploiting structural assumptions.
result Improved estimators with reduced computational cost and similar error level.

Two spectral algorithms for community detection in graphs with covariates are compared.

problem Detecting community structure in graphs with covariates.
method Two model-based spectral algorithms are presented and compared.
result The second algorithm often better estimates block assignments by accounting for vertex covariates.

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.

We study the fundamental limits of detecting the presence of an additive rank-one perturbation, or spike, to a Wigner matrix. When the spike comes from a prior that is i.i.d. across coordinates, we prove that the log-likelihood ratio of the spiked model against the non-spiked one is asymptotically normal below a certai…

2018-06-25abs ↗pdf ↗

Paper studies vertex correspondence recovery in correlated graphs with node features.

problem Recovering hidden vertex correspondence between two correlated graphs with observed edge weights and node features.
method Introduced featured correlated Gaussian Wigner model and proposed QPAlign algorithm for quadratic programming relaxation.
result Characterized optimal information-theoretic thresholds for exact and partial recovery of latent mapping.

Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network's large-scale …

2014-04-02abs ↗pdf ↗

Paper tackles robust graph matching in dense graphs with AMP type algorithm.

problem Matching recovery between correlated Gaussian Wigner matrices with adversarial perturbations.
method Approximate Message Passing (AMP) type iterative algorithm with time-dependent matrix multiplication.
result Algorithm succeeds in polynomial time for non-vanishing correlation and small perturbations.

Simplified Ricci curvature for spherical fluid dynamics models.

problem Studying stability in incompressible fluid dynamics on a sphere.
method Definition and calculation of Ricci curvature for two-dimensional hydrodynamics using finite-dimensional Zeitlin models.
result Strong numerical evidence suggests convergence of finite-dimensional approximations to infinite-dimensional limit, indicating average instability for high-frequency modes.

Clusterpath estimator simplifies graphical model interpretation for large datasets.

problem Difficulty in interpreting graphical models with many variables.
method Clusterpath estimator that groups variables for block-structured precision matrix.
result CGGM outperforms other methods in variable clustering and practical applications.

Learning the "blocking" structure is a central challenge for high dimensional data (e.g., gene expression data). Recently, a sparse singular value decomposition (SVD) has been used as a biclustering tool to achieve this goal. However, this model ignores the structural information between variables (e.g., gene interacti…

2016-03-19abs ↗pdf ↗

Proposes BMME for optimizing nonsmooth nonconvex problems with block structure.

problem Optimizing nonsmooth nonconvex problems with block structure.
method Block Alternating Bregman Majorization Minimization with Extrapolation (BMME).
result Subsequential convergence to a first-order stationary point under mild assumptions, global convergence under stronger conditions.

Paper proposes new methods for improving interatomic potentials.

problem Limitations of conventional SO(2) Linear architectures in MLIPs.
method Direct Cartesian construction, recursive Clebsch-Gordan construction, Edge Complex Product Basis, Radial Rotary Complex Attention.
result TECE-OAM-RRA-1.0 achieves SOTA performance on Matbench Discovery.