Related papers: On spectra of Hermitian Randi\'c matrix of second …

We draw attention to the fact that a Hermitian matrix is always diagonalizable and has real discrete spectrum whereas the Hermitian Schr{\"o}dinger Hamiltonian: $H=p^2/2\mu+V(x)$, may not be so. For instance when $V(x)=x, x^3, -x^2$, $H$…

We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with…

In this work we perform a detailed statistical analysis of topological and spectral properties of random geometric graphs (RGGs); a graph model used to study the structure and dynamics of complex systems embedded in a two dimensional space.…

We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with…

The Helmholtzian matrix of a graph $G=(V(G),E(G))$ is a graph-theoretic analogue of the vector Laplacian (or Helmholtz operator) [S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, 379 (2026) 446--460]. Motivated by the…

We consider the standard overlap $\mathcal{O}_{ij}: =\langle \mathbf{r}_j, \mathbf{r}_i\rangle\langle \mathbf{l}_j, \mathbf{l}_i\rangle$ of any bi-orthogonal family of left and right eigenvectors of a large random matrix $X$ with centred…

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{i}$ the degree of vertex $v_{i}$. Let $f(x, y)>0$ be a real symmetric function in $x$ and $y$. The weighted adjacency matrix $A_{f}(G)$ of a graph $G$ is a square matrix, where the…

Let A and E be Hermitian self-adjoint matrices, where A is fixed and E a small perturbation. We study how the eigenvalues and eigenvectors of A+E depend on E, with the aim of obtaining first order formulas (and when possible also second…

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

The $f$ adjacency matrix is a type of edge-weighted adjacency matrix, whose weight of an edge $ij$ is $f(d_i,d_j)$, where $f$ is a real symmetric function and $d_i,d_j$ are the degrees of vertex $i$ and vertex $j$. The $f$-spectral radius…

For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…

We compute expectation values of mixed traces containing both matrices in a two matrix model, i.e. generating function for counting bicolored discrete surfaces with non uniform boundary conditions. As an application, we prove the $x-y$…

In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…

The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is…

A $n\times n$ matrix $A$, which has a certain sign-symmetric structure ($J$--sign-symmetric), is studied in this paper. It is shown that such a matrix is similar to a nonnegative matrix. The existence of the second in modulus positive…

Reed conjectured that for every graph, $\chi \leq \left \lceil \frac{\Delta + \omega + 1}{2} \right \rceil$ holds, where $\chi$, $\omega$ and $\Delta$ denote the chromatic number, clique number and maximum degree of the graph, respectively.…

We develop a supersymmetric field theoretical description of the Gaussian ensemble of the almost diagonal Hermitian Random Matrices. The matrices have independent random entries H_{ij} with parametrically small off-diagonal elements…

We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…