Related papers: Random perturbation of low rank matrices: Improvin…
Scaling transformations involving a small parameter ({\em degenerate scalings}) are frequently used for ordinary differential equations that model (bio-) chemical reaction networks. They are motivated by quasi-steady state (QSS) of certain…
We consider the problem of estimating covariance and precision matrices, and their associated discriminant coefficients, from normal data when the rank of the covariance matrix is strictly smaller than its dimension and the available sample…
In earlier work we showed that a frame dependent effective action motivated by the postulates of three-space general coordinate invariance and Weyl scaling invariance exactly mimics a cosmological constant in Robertson-Walker (RW)…
A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an…
The statistics of gaps between quantum energy levels is a hallmark criterion in quantum chaos and quantum integrability studies. The relevant distributions corresponding to exactly integrable vs. fully chaotic systems are universal and…
We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and the corresponding…
We study substructures of the Weyl group of conformal transformations of the metric of (pseudo)Riemannian manifolds. These substructures are identified by differential constraints on the conformal factors of the transformations which are…
Mathematical models are an essential component of quantitative science. They generate predictions about the future, based on information available in the present. In the spirit of Occam's razor, simpler is better; should two models make…
For a compact Riemannian locally symmetric space $\Gamma\backslash G/K$ of arbitrary rank we determine the location of certain Ruelle-Taylor resonances for the Weyl chamber action. We provide a Weyl-lower bound on an appropriate counting…
We define the notion of Weyl anomalies, measuring the violation of local scale invariance, in interacting quantum field theory on curved spacetimes in the framework of locally covariant field theory. We discuss some general properties of…
A theory of rank $k\ge 2$ perturbation of symplectic matrices and Hamiltonian systems with periodic coefficients using a base of isotropic subspaces, is presented. After showing that the fundamental matrix ${\displaystyle…
Random contractions (sub-unitary random matrices) appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with discrete time. We analyze statistical properties of complex…
A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any…
Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…
The singular subspaces perturbation theory is of fundamental importance in probability and statistics. It has various applications across different fields. We consider two arbitrary matrices where one is a leave-one-column-out submatrix of…
In this paper we provide a comprehensive study of statistical inference in linear and allied models which exhibit some analytic perturbations in their design and covariance matrices. We also indicate a few potential applications. In the…
Quantum computing, with its potential to enhance various machine learning tasks, allows significant advancements in kernel calculation and model precision. Utilizing the one-class Support Vector Machine alongside a quantum kernel, known for…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
New insight into the correspondence between Quantum Chaos and Random Matrix Theory is gained by developing a semiclassical theory for the autocorrelation function of spectral determinants. We study in particular the unitary operators which…
Models in which the covariance matrix has the structure of a sparse matrix plus a low rank perturbation are ubiquitous in data science applications. It is often desirable for algorithms to take advantage of such structures, avoiding costly…