Related papers: What is the Simplest Linear Ramp?
Ridge leverage scores provide a balance between low-rank approximation and regularization, and are ubiquitous in randomized linear algebra and machine learning. Deterministic algorithms are also of interest in the moderately big data…
We show that, within a finite window of parameter space, random matrix theory (RMT) statistics emerge in observables of a finite-volume massive free scalar field theory after a local operator quench. The spacing-ratio distribution of…
In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of…
In the theory of disordered systems the spectral form factor $S(\tau)$, the Fourier transform of the two-level correlation function with respect to the difference of energies, is linear for $\tau<\tau_c$ and constant for $\tau>\tau_c$. Near…
We show that, under mild assumptions on the limiting curve, a sequence of simple chordal planar curves converges uniformly whenever certain Loewner driving functions converge. We extend this result to random curves. The random version…
Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…
Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…
We study spectral densities for systems on lattices, which, at a phase transition display, power-law spatial correlations. Constructing the spatial correlation matrix we prove that its eigenvalue density shows a power law that can be…
The spectral form factor (SFF) can probe the eigenvalue statistic at different energy scales as its time variable varies. In closed quantum chaotic systems, the SFF exhibits a universal dip-ramp-plateau behavior, which reflects the spectrum…
Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…
Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ of rank r. Moreover, $f$ can always be written as a composition of folds and a graph…
We propose to study echo dynamics in a random matrix framework, where we assume that the perturbation is time independent, random and orthogonally invariant. This allows to use a basis in which the unperturbed Hamiltonian is diagonal and…
Random features are a powerful technique for rewriting positive-definite kernels as linear products. They bring linear tools to bear in important nonlinear domains like KNNs and attention. Unfortunately, practical implementations require…
This paper is concerned with regular approximations of spectra of singular discrete linear Hamiltonian systems with one singular endpoint. For any given self-adjoint subspace extension (SSE) of the corresponding minimal subspace, its…
In this article, we study microscopic properties of a two-dimensional eigenvalue ensemble near a conical singularity arising from insertion of a point charge in the bulk of the support of eigenvalues. In particular, we characterize all…
The aim of this note is to announce some results about the probabilistic and deterministic asymptotic properties of linear groups. The first one is the analogue, for norms of random matrix products, of the classical theorem of Cramer on…
Various forms of regularization in learning tasks strive for different notions of simplicity. This paper presents a spectral regularization technique, which attaches a unique inductive bias to sequence modeling based on an intuitive concept…
The spectral resolving power R = lambda / delta lambda is a key property of any spectrograph, but its definition is vague because the `smallest resolvable wavelength difference' delta lambda does not have a consistent definition. Often the…
We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…
It recently has been found that methods of the statistical theories of spectra can be a useful tool in the analysis of spectra far from levels of Hamiltonian systems. Several examples originate from areas, such as quantitative linguistics…