English
Related papers

Related papers: Universal hypotrochoidic law for random matrices w…

200 papers

Normalized eigenvalue counting measure of the sum of two Hermitian (or real symmetric) matrices $A_{n}$ and $B_{n}$ rotated independently with respect to each other by the random unitary (or orthogonal) Haar distributed matrix $U_{n}$ (i.e.…

Mathematical Physics · Physics 2016-08-15 L. Pastur , V. Vasilchuk

Let $(X_{jk})_{j,k\geq 1}$ be an infinite array of i.i.d. complex random variables, with mean 0 and variance 1. Let $\la_{n,1},...,\la_{n,n}$ be the eigenvalues of $(\frac{1}{\sqrt{n}}X_{jk})_{1\leq j,k\leq n}$. The strong circular law…

Probability · Mathematics 2010-11-09 Djalil Chafai

Random matrix theory, which characterizes spectral distributions of infinitely large matrices, plays a central role across diverse fields, including high-dimensional data analysis, ecology, neuroscience, and machine learning. Among its key…

Disordered Systems and Neural Networks · Physics 2026-05-26 Arata Tomoto , Jun-nosuke Teramae

Sensitivity of an eigenvalue $\lambda_i$ to the perturbation of matrix elements is controlled by the eigenvalue condition number defined as $\kappa_i = \sqrt{\left< L_i | L_i\right> \left< R_i|R_i \right> }$, where $\left<L_i\right|$ and…

Mathematical Physics · Physics 2024-06-13 Wojciech Tarnowski

In this paper, we derive nonasymptotic theoretical bounds for the influence in random graphs that depend on the spectral radius of a particular matrix, called the Hazard matrix. We also show that these results are generic and valid for a…

Probability · Mathematics 2016-03-28 Rémi Lemonnier , Kevin Scaman , Nicolas Vayatis

We compare the spectrum and the localisation properties of the eigenmodes of the Laplacian and the adjacency matrix of 2D random geometric graphs, using numerical diagonalization of these matrices for different system sizes and…

Disordered Systems and Neural Networks · Physics 2026-04-01 Luca Schaefer , Barbara Drossel

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

Combinatorics · Mathematics 2018-03-23 Michael Krivelevich , Matthew Kwan , Benny Sudakov

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…

Probability · Mathematics 2020-01-22 Werner Kirsch , Thomas Kriecherbauer

We show that the averaged characteristic polynomial and the averaged inverse characteristic polynomial, associated with Hermitian matrices whose elements perform a random walk in the space of complex numbers, satisfy certain partial…

Mathematical Physics · Physics 2015-12-22 Jean-Paul Blaizot , Jacek Grela , Maciej A. Nowak , Piotr Warchoł

We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…

Mathematical Physics · Physics 2021-08-25 Yuriy Stepanov , Hendrik Herrmann , Thomas Guhr

Consider $N\times N$ Hermitian or symmetric random matrices $H$ where the distribution of the $(i,j)$ matrix element is given by a probability measure $\nu_{ij}$ with a subexponential decay. Let $\sigma_{ij}^2$ be the variance for the…

Mathematical Physics · Physics 2011-09-27 Laszlo Erdos , Horng-Tzer Yau , Jun Yin

We establish the relation between two objects: an integrable system related to Painlev\'e II equation, and the symplectic invariants of a certain plane curve S(TW). This curve describes the average eigenvalue density of a random hermitian…

Exactly Solvable and Integrable Systems · Physics 2010-12-14 Gaetan Borot , Bertrand Eynard

Affinity has proven to be a useful tool for quantifying the non-equilibrium character of time continuous Markov processes since it serves as a measure for the breaking of time reversal symmetry. It has recently been conjectured that the…

Statistical Mechanics · Physics 2020-07-27 Matthias Uhl , Udo Seifert

A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…

High Energy Physics - Theory · Physics 2008-02-03 B. Eynard

Electronic transport through chaotic quantum dots exhibits universal, system independent, properties, consistent with random matrix theory. The quantum transport can also be rooted, via the semiclassical approximation, in sums over the…

Chaotic Dynamics · Physics 2013-03-06 Gregory Berkolaiko , Jack Kuipers

The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…

Combinatorics · Mathematics 2015-05-07 Krystal Guo , Bojan Mohar

We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…

Statistical Mechanics · Physics 2018-12-05 Joël Bun , Jean-Philippe Bouchaud , Marc Potters

We consider matrix-valued processes described as solutions to stochastic differential equations of very general form. We study the family of the empirical measure-valued processes constructed from the corresponding eigenvalues. We show that…

Probability · Mathematics 2019-01-10 Jacek Małecki , José Luis Pérez

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

Probability · Mathematics 2010-06-04 Florian Sobieczky