Related papers: The Rotor Model with spectral parameters and enume…
Given pairwise comparisons between multiple items, how to rank them so that the ranking matches the observations? This problem, known as rank aggregation, has found many applications in sports, recommendation systems, and other web…
One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…
In this paper we develop and apply methods for the spectral analysis of non-self-adjoint tridiagonal infinite and finite random matrices, and for the spectral analysis of analogous deterministic matrices which are pseudo-ergodic in the…
In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given values of the minimum rank distance. We computationally compare…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix…
The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…
We analyze all orthonormal bases of exponentials on the Cantor set defined by Jorgensen and Pedersen in J. Anal. Math. 75,1998, pp 185-228. A complete characterization for all maximal sets of orthogonal exponentials is obtained by…
We revisit the relative perturbation theory for invariant subspaces of positive definite matrix pairs. As a prototype model problem for our results we consider parameter dependent families of eigenvalue problems. We show that new estimates…
In this paper we parameterize non-negative matrices of sum one and rank at most two. More precisely, we give a family of parameterizations using the least possible number of parameters. We also show how these parameterizations relate to a…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
The aim of this note is to prove that fluctuations of uniformly random alternating sign matrices (equivalently, configurations of the six-vertex model with domain wall boundary conditions) near the boundary are described by the Gaussian…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign matrices (ASMs). Specifically, these statistics are the positions of the 1's in the first and last rows and columns of an ASM, and the…
This work is a companion paper of Gamboa, Nagel, Rouault (J. Funct. Anal. 2016). We continue to explore the connections between large deviations for random objects issued from random matrix theory and sum rules. Here, we are concerned…
While Spectral Methods have long been used for Principal Component Analysis, this survey focusses on work over the last 15 years with three salient features: (i) Spectral methods are useful not only for numerical problems, but also discrete…
A number theoretical model of $1/f$ noise found in phase locked loops is developed. The dynamics of phases and frequencies involved in the nonlinear mixing of oscillators and the low-pass filtering is formulated thanks to the rules of the…
In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed a large gap between estimation with unbounded computational…