Sean O'Rourke’s research while affiliated with University of Colorado Boulder and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (54)


Gaps between Singular Values of Sample Covariance Matrices
  • Preprint
  • File available

February 2025

·

5 Reads

Nicholas Christoffersen

·

·

Sean O'Rourke

·

Calum Shearer

We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if M is an n×pn \times p random matrix with independent and identically distributed entries and Σ\Sigma is a n×nn \times n deterministic positive definite matrix, then under some technical assumptions we give lower bounds for the gaps between consecutive singular values of Σ1/2M\Sigma^{1/2} M. As a consequence, we show that sample covariance matrices have simple spectrum with high probability. Our results resolve a conjecture of Vu [{\em Probab. Surv.}, 18:179--200, 2021]. We also discuss some applications, including a bound on the spacings of eigenvalues of the adjacency matrix of random bipartite graphs.

Download

Universality for roots of derivatives of entire functions via finite free probability

October 2024

·

8 Reads

A universality conjecture of Farmer and Rhoades [Trans. Amer. Math. Soc., 357(9):3789--3811, 2005] and Farmer [Adv. Math., 411:Paper No. 108781, 14, 2022] asserts that, under some natural conditions, the roots of an entire function should become perfectly spaced in the limit of repeated differentiation. This conjecture is known as Cosine Universality. We establish this conjecture for a class of even entire functions with only real roots which are real on the real line. Along the way, we establish a number of additional universality results for Jensen polynomials of entire functions, including the Hermite Universality conjecture of Farmer [Adv. Math., 411:Paper No. 108781, 14, 2022]. Our proofs are based on finite free probability theory. We establish finite free probability analogs of the law of large numbers, central limit theorem, and Poisson limit theorem for sequences of deterministic polynomials under repeated differentiation, under optimal moment conditions, which are of independent interest.


The fractional free convolution of R -diagonal elements and random polynomials under repeated differentiation

April 2024

·

19 Reads

·

5 Citations

International Mathematics Research Notices

We extend the free convolution of Brown measures of R-diagonal elements introduced by Kösters and Tikhomirov [ 28] to fractional powers. We then show how this fractional free convolution arises naturally when studying the roots of random polynomials with independent coefficients under repeated differentiation. When the proportion of derivatives to the degree approaches one, we establish central limit theorem-type behavior and discuss stable distributions.


Spectrum of Lévy–Khintchine Random Laplacian Matrices

July 2023

·

18 Reads

·

1 Citation

Journal of Theoretical Probability

We consider the spectrum of random Laplacian matrices of the form Ln=AnDnL_n=A_n-D_n where AnA_n is a real symmetric random matrix and DnD_n is a diagonal matrix whose entries are equal to the corresponding row sums of AnA_n. If AnA_n is a Wigner matrix with entries in the domain of attraction of a Gaussian distribution, the empirical spectral measure of LnL_n is known to converge to the free convolution of a semicircle distribution and a standard real Gaussian distribution. We consider real symmetric random matrices AnA_n with independent entries (up to symmetry) whose row sums converge to a purely non-Gaussian infinitely divisible distribution, which fall into the class of Lévy–Khintchine random matrices first introduced by Jung [Trans Am Math Soc, 370, (2018)]. Our main result shows that the empirical spectral measure of LnL_n converges almost surely to a deterministic limit. A key step in the proof is to use the purely non-Gaussian nature of the row sums to build a random operator to which LnL_n converges in an appropriate sense. This operator leads to a recursive distributional equation uniquely describing the Stieltjes transform of the limiting empirical spectral measure.


The fractional free convolution of R-diagonal operators and random polynomials under repeated differentiation

July 2023

·

9 Reads

We extend the free convolution of Brown measures of R-diagonal elements introduced by K\"{o}sters and Tikhomirov [Probab. Math. Statist. 38 (2018), no. 2, 359--384] to fractional powers. We then show how this fractional free convolution arises naturally when studying the roots of random polynomials with independent coefficients under repeated differentiation. When the proportion of derivatives to the degree approaches one, we establish central limit theorem-type behavior and discuss stable distributions.



Matrices With Gaussian Noise: Optimal Estimates for Singular Subspace Perturbation

January 2023

·

1 Read

·

10 Citations

IEEE Transactions on Information Theory

The Davis–Kahan–Wedin sinΘ\sin \Theta theorem describes how the singular subspaces of a matrix change when subjected to a small perturbation. This classic result is sharp in the worst case scenario. In this paper, we prove a stochastic version of the Davis–Kahan–Wedin sinΘ\sin \Theta theorem when the perturbation is a Gaussian random matrix. Under certain structural assumptions, we obtain an optimal bound that significantly improves upon the classic Davis–Kahan–Wedin sinΘ\sin \Theta theorem. One of our key tools is a new perturbation bound for the singular values, which may be of independent interest.


Extreme eigenvalues of Laplacian random matrices with Gaussian entries

November 2022

·

33 Reads

Andrew Campbell

·

·

Sean O'Rourke

·

[...]

·

A Laplacian matrix is a real symmetric matrix whose row and column sums are zero. We investigate the limiting distribution of the largest eigenvalue of a Laplacian random matrix with Gaussian entries. Unlike many classical matrix ensembles, this random matrix model contains dependent entries. After properly shifting and scaling, we show the largest eigenvalue converges to the Gumbel distribution as the dimension of the matrix tends to infinity. While the largest diagonal entry is also shown to have Gumbel fluctuations, there is a rather surprising difference between its deterministic centering term and the centering term required for the largest eigenvalue.


Spectrum of L\'evy-Khintchine Random Laplacian Matrices

October 2022

·

10 Reads

We consider the spectrum of random Laplacian matrices of the form Ln=AnDnL_n=A_n-D_n where AnA_n is a real symmetric random matrix and DnD_n is a diagonal matrix whose entries are equal to the corresponding row sums of AnA_n. If AnA_n is a Wigner matrix the empirical spectral measure of LnL_n is known to converge to the free convolution of a semicircle distribution and a standard real Gaussian distribution. We consider matrices AnA_n whose row sums converge to a purely non-Gaussian infinitely divisible distribution. Our main result shows that the empirical spectral measure of LnL_n converges almost surely to a deterministic limit. A key step in the proof is to use the purely non-Gaussian nature of the row sums to build a random operator to which LnL_n converges in an appropriate sense. This operator leads to a recursive distributional equation uniquely describing the Stieltjes transform of the limiting empirical spectral measure.


Quantitative results for banded Toeplitz matrices subject to random and deterministic perturbations

October 2022

·

9 Reads

Linear Algebra and its Applications

We consider the eigenvalues of a fixed, non-normal matrix subject to a small additive perturbation. In particular, we consider the case when the fixed matrix is a banded Toeplitz matrix, where the bandwidth is allowed to grow slowly with the dimension, and the perturbation matrix is drawn from one of several different random matrix ensembles. We establish a number of non-asymptotic results for the eigenvalues of this model, including a local law and a rate of convergence in Wasserstein distance of the empirical spectral measure to its limiting distribution. In addition, we define the classical locations of the eigenvalues and prove a rigidity result showing that, on average, the eigenvalues concentrate closely around their classical locations. While proving these results we also establish a number of auxiliary results that may be of independent interest, including a quantitative version of the Tao–Vu replacement principle, a general least singular value bound that applies to adversarial models, and a description of the limiting empirical spectral measure for random multiplicative perturbations.


Citations (31)


... This observation was made by comparing the PDEs studied in [41,42] describing the evolution under these processes. This has been made rigorous and extended by multiple authors [1,2,13,14,21,23]. In particular [1,2,14] place Steinerberger's observation in the context of finite free probability to show that in an appropriate sense this connection holds on all possible scales. ...

Reference:

Free infinite divisibility, fractional convolution powers, and Appell polynomials
The fractional free convolution of R -diagonal elements and random polynomials under repeated differentiation
  • Citing Article
  • April 2024

International Mathematics Research Notices

... Empirically, it has been observed that these assumptions are reasonable for weight matrices of a DNN; see [51,49]. There are various spiked models in which Assumptions 5-7 hold, for more on the subject see [4,8,20,17,6,36,2,13,5,29,60,20,37]. Also, a number of works in RMT addressed the connection between a random matrix R and the singular values and singular vectors of the deformed matrix W " R`S, see [7,8]. ...

Matrices With Gaussian Noise: Optimal Estimates for Singular Subspace Perturbation
  • Citing Article
  • January 2023

IEEE Transactions on Information Theory

... The sensitivity of invariant, deflation and singular subspaces of matrices is considered in detail in the fundamental book of Stewart and Sun [1], as well as in the surveys of Bhatia [2] and Li [3]. In particular, perturbation analysis of the eigenvectors and invariant subspaces of matrices affected by deterministic and random perturbations is presented in several papers and books, see for instance [4][5][6][7][8][9][10][11][12]. Survey [13] is entirely devoted to the asymptotic (first-order) perturbation analysis of eigenvalues and eigenvectors. ...

Optimal Subspace Perturbation Bounds under Gaussian Noise
  • Citing Conference Paper
  • June 2023

... This universality result is the elliptic counterpart of the circular law established by Tao and Vu [41] after a series of partial results; see [9] for a detailed historic discussion. Additional spectral properties of elliptic random matrices have been studied in [2,7,11,12,15,25,31,32,33] and references therein. ...

Spectrum of heavy-tailed elliptic random matrices
  • Citing Article
  • January 2022

Electronic Journal of Probability

... In this work we study non-Hermitian versions of random band matrix, where even global universality, i.e. the convergence of the empirical spectral density to the circular law, remains largely unproven. In recent works [28] [44] the authors established circular law for certain non-Hermitian band matrices with bandwidth n γ with γ sufficiently close to 1: more precisely they require γ > 32 33 . The main contribution of this paper is to consider much narrower bandwidth and expand the variety of models where global universality holds: we show γ > 5 6 is enough for the circular law for Gaussian entries, and for a very broad class of inhomogeneous matrix models with doubly stochastic variance profile. ...

Circular law for random block band matrices with genuinely sublinear bandwidth
  • Citing Article
  • August 2021

... In particular, the results hold for the adjacency matrix of Erdős-Rényi random graphs, which addressed a conjecture of Babai and is related to the graph isomorphism problem [3]. The gaps between complex eigenvalues of non-Hermitian random matrices with independent entries were studied in [15]; these results were improved upon in [29]. ...

Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
  • Citing Article
  • January 2021

Electronic Journal of Probability

... Rudelson and Vershynin's 2016 work [23] systematically explored the "delocalization" of the general random matrices eigenvector. For non-Hermitian matrices, results from [12] and [11] improved Rudelson and Vershynin's bounds. This paper also enhances these bounds for symmetric random matrices (see Section 1.4 for details). ...

Eigenvector delocalization for non‐Hermitian random matrices and applications

Random Structures and Algorithms

... The fluctuation formula (3.72) with β = 2 has been shown to remain valid in the case of the eigenvalues of products of i.i.d. complex random matrices in [116], albeit for a class of test function contained strictly inside the eigenvalue support; see too [50]. ...

Gaussian Fluctuations for Linear Eigenvalue Statistics of Products of Independent iid Random Matrices

Journal of Theoretical Probability