English
Related papers

Related papers: The circular law for random band matrices: improve…

200 papers

Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…

Information Theory · Computer Science 2015-06-25 Lu Wei , Renaud-Alexandre Pitaval , Jukka Corander , Olav Tirkkonen

For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. In the companion article Cook et al., we considered the…

Probability · Mathematics 2020-07-31 Nicholas A. Cook , Walid Hachem , Jamal Najim , David Renfrew

The aim of this paper is to prove a local version of the circular law for non-Hermitian random matrices and its generalization to the product of non-Hermitian random matrices under weak moment conditions. More precisely we assume that the…

Probability · Mathematics 2018-12-10 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

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…

Disordered Systems and Neural Networks · Physics 2026-05-15 Pierre Bousseyroux , Marc Potters

We consider the hermitian random matrix model with external source and general polynomial potential, when the source has two distinct eigenvalues but is otherwise arbitrary. All such models studied so far have a common feature: an…

Mathematical Physics · Physics 2020-12-11 Andrei Martínez-Finkelshtein , Guilherme L. F. Silva

This work extends Favard-type spectral representations for banded matrices $T$ beyond the bounded setting. It assumes that, for every $N\in\mathbb N_0$, there exists a shift $s_N\ge 0$ such that the shifted truncation $A_N:= T^{[N]}+s_N…

Classical Analysis and ODEs · Mathematics 2026-02-04 Amílcar Branquinho , Ana Foulquié-Moreno , Manuel Mañas

In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the underlying input. These matrices have…

Computational Complexity · Computer Science 2024-11-22 Jeff Xu

The mean shift (MS) is a non-parametric, density-based, iterative algorithm with prominent usage in clustering and image segmentation. A rigorous proof for the convergence of its mode estimate sequence in full generality remains unknown. In…

Machine Learning · Statistics 2026-03-17 Susovan Pal

Random measurements have been shown to induce a phase transition in an extended quantum system evolving under chaotic unitary dynamics, when the strength of measurements exceeds a threshold value. Below this threshold, a steady state with a…

Statistical Mechanics · Physics 2021-06-02 Ruihua Fan , Sagar Vijay , Ashvin Vishwanath , Yi-Zhuang You

We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that…

Probability · Mathematics 2016-08-11 Afonso S. Bandeira , Ramon van Handel

Consider the matrix $A_{\mathcal{G}}$ chosen uniformly at random from the finite set of all $N$-dimensional matrices of zero main-diagonal and binary entries, having each row and column of $A_{\mathcal{G}}$ sum to $d$. That is, the…

Probability · Mathematics 2025-07-31 Arka Adhikari , Amir Dembo

The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…

Data Analysis, Statistics and Probability · Physics 2026-03-26 Mario Castro , José A. Cuesta

Mirror Descent is a popular algorithm, that extends Gradients Descent (GD) beyond the Euclidean geometry. One of its benefits is to enable strong convergence guarantees through smooth-like analyses, even for objectives with exploding or…

Optimization and Control · Mathematics 2024-04-19 Hadrien Hendrikx

The Altshuler-Shklovskii formulas [1] predict, for any disordered quantum system in the diffusive regime, a universal power law behaviour for the correlation functions of the mesoscopic eigenvalue density. In this paper and its companion…

Probability · Mathematics 2014-03-21 Laszlo Erdos , Antti Knowles

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

The variance of the number of particles in a set is an important quantity in understanding the statistics of non-interacting fermionic systems in low dimensions. An exact map of their ground state in a harmonic trap in one and two…

Mathematical Physics · Physics 2026-03-26 G. Akemann , M. Duits , L. D. Molag

A new plug-in rule procedure for bandwidth selection in kernel circular density estimation is introduced. The performance of this proposal is checked throughout a simulation study considering a variety of circular distributions exhibiting…

Methodology · Statistics 2012-02-29 M. Oliveira , R. M. Crujeiras , A. Rodríguez-Casal

We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…

Probability · Mathematics 2018-12-17 Anirban Basak , Elliot Paquette , Ofer Zeitouni

We consider random walks on ``balanced multislices'' of any ``grid'' that respects the ``symmetries'' of the grid, and show that a broad class of such walks are good spectral expanders. (A grid is a set of points of the form $\mathcal{S}^n$…

Computational Complexity · Computer Science 2025-07-16 Prashanth Amireddy , Amik Raj Behera , Srikanth Srinivasan , Madhu Sudan

In this paper, we study the restricted isometry property of partial random circulant matrices. For a bounded subgaussian generator with independent entries, we prove that the partial random circulant matrices satisfy $s$-order RIP with high…

Information Theory · Computer Science 2018-08-23 Meng Huang , Yuxuan Pang , Zhiqiang Xu