To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We investigate the limiting spectral distribution of a noncentral unified matrix model defined by $\boldsymbol{\Omega}(\mathbf{X}) = ({(\mathbf{X}\mathbf{P}_1+\mathbf{A})(\mathbf{X}\mathbf{P}_1+\mathbf{A})'}/{n_1}) ({\mathbf{X}\mathbf{P}_2\mathbf{X}'}/{n_2})^{-1}$, where $\mathbf{X}=(X_{ij})_{p\times n}$ is a random matrix with independent and identically distributed real entries having zero mean and finite second moment. $\mathbf{A}$ is a $p\times n$ nonrandom matrix. The matrices $\mathbf{P}_1$ and $\mathbf{P}_2$ are projection matrices satisfying $\mathrm{rank}(\mathbf{P}_1)=n_1$, $\mathrm{rank}(\mathbf{P}_2)=n_2$, and $\mathbf{P}_1\mathbf{P}_2=0$. When $\mathbf{P}_1$ and $\mathbf{P}_2$ are random, they are assumed to be independent of $\mathbf{X}$. When $p/n_1\to c_1\in(0,\infty)$ and $p/n_2\to c_2\in(0,1)$, we establish the almost sure convergence of the empirical spectral distribution of $\boldsymbol{\Omega}$ to a deterministic limiting distribution. Furthermore, we show that this limiting distribution coincides with that of the noncentral F-matrix, thus revealing a deep connection between the proposed model and classical multivariate analysis.
We consider a family $b_{s,\tau }$ of free multiplicative Brownian motions labeled by a real variance parameter s and a complex covariance parameter $\tau $. We then consider the element $xb_{s,\tau }$, where x is non-negative and freely independent of $b_{s,\tau }$. Our goal is to identify the support of the Brown measure of $xb_{s,\tau }$. In the case $\tau =s$, we identify a region $\Sigma _s$ such that the Brown measure is vanishing outside of $\overline {\Sigma }_s$ except possibly at the origin. For general values of $\tau $, we construct a map $f_{s-\tau }$ and define $D_{s,\tau }$ as the complement of $f_{s-\tau }(\overline {\Sigma }_s^c)$. Then, the Brown measure is zero outside $D_{s,\tau }$ except possibly at the origin. The proof of these results is based on a two-stage PDE analysis, using one PDE (following the work of Driver, Hall, and Kemp) for the case $\tau =s$ and a different PDE (following the work of Hall and Ho) to deform the $\tau =s$ case to general values of $\tau $.
Networks describe complex relationships between individual actors. In this work, we address the question of how to determine whether a parametric model, such as a stochastic block model or latent space model, fits a data set well, and will extrapolate to similar data. We use recent results in random matrix theory to derive a general goodness-of-fit (GoF) test for dyadic data. We show that our method, when applied to a specific model of interest, provides a straightforward, computationally fast way of selecting parameters in a number of commonly used network models. For example, we show how to select the dimension of the latent space in latent space models. Unlike other network GoF methods, our general approach does not require simulating from a candidate parametric model, which can be cumbersome with large graphs, and eliminates the need to choose a particular set of statistics on the graph for comparison. It also allows us to perform GoF tests on partial network data, such as Aggregated Relational Data. We show with simulations that our method performs well in many situations of interest. We analyze several empirically relevant networks and show that our method leads to improved community detection algorithms.
There are many applications of the low-rank signal-plus-noise model 𝒀 = 𝑿 + 𝒁 where 𝑿 is a low-rank matrix and 𝒁 is noise, such as denoising and dimensionality reduction. We are interested in the properties of the latent matrix 𝑿, such as its singular value decomposition (SVD), but all we are given is the noisy matrix 𝒀. It is important to understand how the SVD components of 𝒀 relate to those of 𝑿 in the presence of a random noise matrix 𝒁. The field of random matrix theory (RMT) provides insights into those relationships, and this chapter summarizes some key results from RMT that help explain how the noise in 𝒁 perturbs the SVD components, by analyzing limits as matrix dimensions increase. The perturbations considered include roundoff error, additive Gaussian noise, outliers, and missing data. This is the only chapter that requires familiarity with the distributions of continuous random variables, and it provides many pointers to the literature on this modern topic, along with several demos that illustrate remarkable agreement between the asymptotic predictions and the empirical performance even for modest matrix sizes.
We investigate the synchronization of the Eurozone’s government bond yields at different maturities. For this purpose, we combine principal component analysis with random matrix theory. We find that synchronization depends on yield maturity. Short-term yields are not synchronized. Medium- and long-term yields, instead, were highly synchronized early after the introduction of the Euro. Synchronization then decreased significantly during the Great Recession and the European Debt Crisis, to partially recover after 2015. We interpret our empirical results using portfolio theory, and we point to divergence trades as a source of the self-sustained yield asynchronous dynamics. Our results envisage synchronization as a requirement for the smooth transmission of conventional monetary policy in the Eurozone.
We find closed formulas for arbitrarily high mixed moments of characteristic polynomials of the Alternative Circular Unitary Ensemble, as well as closed formulas for the averages of ratios of characteristic polynomials in this ensemble. A comparison is made to analogous results for the Circular Unitary Ensemble. Both moments and ratios are studied via symmetric function theory and a general formula of Borodin-Olshanski-Strahov.
We calculate the moments of the characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, at a position t in the bulk of the spectrum, as a series expansion in powers of t. We focus in particular on the Gaussian Unitary Ensemble. We employ a novel approach to calculate the coefficients in this series expansion of the moments, appropriately scaled. These coefficients are polynomials in N. They therefore grow as $N\to\infty$, meaning that in this limit the radius of convergence of the series expansion tends to zero. This is related to oscillations as t varies that are increasingly rapid as N grows. We show that the $N\to\infty$ asymptotics of the moments can be derived from this expansion when $t=0$. When $t\ne 0$ we observe a surprising cancellation when the expansion coefficients for N and $N+1$ are formally averaged: this procedure removes all of the N-dependent terms leading to values that coincide with those expected on the basis of previously established asymptotic formulae for the moments. We obtain as well formulae for the expectation values of products of the secular coefficients.
We show that for an $n\times n$ random symmetric matrix $A_n$, whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable $\xi$ with mean 0 and variance 1,
This improves a result of Vershynin, who obtained such a bound with $n^{1/2}$ replaced by $n^{c}$ for a small constant c, and $1/8$ replaced by $(1/8) - \eta$ (with implicit constants also depending on $\eta > 0$). Furthermore, when $\xi$ is a Rademacher random variable, we prove that
The special case $\epsilon = 0$ improves a recent result of Campos, Mattos, Morris, and Morrison, which showed that $\mathbb{P}[s_n(A_n) = 0] \le O(\exp(\!-\Omega(n^{1/2}))).$ Notably, in a departure from the previous two best bounds on the probability of singularity of symmetric matrices, which had relied on somewhat specialized and involved combinatorial techniques, our methods fall squarely within the broad geometric framework pioneered by Rudelson and Vershynin, and suggest the possibility of a principled geometric approach to the study of the singular spectrum of symmetric random matrices. The main innovations in our work are new notions of arithmetic structure – the Median Regularized Least Common Denominator (MRLCD) and the Median Threshold, which are natural refinements of the Regularized Least Common Denominator (RLCD)introduced by Vershynin, and should be more generally useful in contexts where one needs to combine anticoncentration information of different parts of a vector.
We consider a class of sample covariance matrices of the form Q = TXX*T*, where X = (xij) is an M×N rectangular matrix consisting of independent and identically distributed entries, and T is a deterministic matrix such that T*T is diagonal. Assuming that M is comparable to N, we prove that the distribution of the components of the right singular vectors close to the edge singular values agrees with that of Gaussian ensembles provided the first two moments of xij coincide with the Gaussian random variables. For the right singular vectors associated with the bulk singular values, the same conclusion holds if the first four moments of xij match those of the Gaussian random variables. Similar results hold for the left singular vectors if we further assume that T is diagonal.
In this series of papers, we explore moments of derivatives of L-functions in function fields using classical analytic techniques such as character sums and approximate functional equation. The present paper is concerned with the study of mean values of derivatives of quadratic Dirichlet L-functions over function fields when the average is taken over monic and irreducible polynomials P in 𝔽q[T]. When the cardinality q of the ground field is fixed and the degree of P gets large, we obtain asymptotic formulas for the first moment of the first and the second derivative of this family of L-functions at the critical point. We also compute the full polynomial expansion in the asymptotic formulas for both mean values.
We study the fluctuations in the distribution of zeros of zeta functions of a family of hyperelliptic curves defined over a fixed finite field, in the limit of large genus. According to the Riemann hypothesis for curves, the zeros all lie on a circle. Their angles are uniformly distributed, so for a curve of genus g a fixed interval ℐ will contain asymptotically 2g∣ℐ∣ angles as the genus grows. We show that for the variance of number of angles in ℐ is asymptotically (2/π2)log (2g∣ℐ∣) and prove a central limit theorem: the normalized fluctuations are Gaussian. These results continue to hold for shrinking intervals as long as the expected number of angles 2g∣ℐ∣ tends to infinity.
We investigate the large weight ($k\to\infty$) limiting statistics for the low lying zeros of a GL(4) and a GL(6) family of $L$-functions, $\{L(s,\phi \times f): f \in H_k\}$ and $\{L(s,\phi \times {\rm sym}^2 f): f \in H_k\}$; here $\phi$ is a fixed even Hecke–Maass cusp form and $H_k$ is a Hecke eigenbasis for the space $H_k$ of holomorphic cusp forms of weight $k$ for the full modular group. Katz and Sarnak conjecture that the behavior of zeros near the central point should be well modeled by the behavior of eigenvalues near 1 of a classical compact group. By studying the 1- and 2-level densities, we find evidence of underlying symplectic and SO(even) symmetry, respectively. This should be contrasted with previous results of Iwaniec–Luo–Sarnak for the families $\{L(s,f): f\in H_k\}$ and $\{L(s,{\rm sym}^2f): f\in H_k\}$, where they find evidence of orthogonal and symplectic symmetry, respectively. The present examples suggest a relation between the symmetry type of a family and that of its twistings, which will be further studied in a subsequent paper. Both the GL(4) and the GL(6) families above have all even functional equations, and neither is naturally split from an orthogonal family. A folklore conjecture states that such families must be symplectic, which is true for the first family but false for the second. Thus, the theory of low lying zeros is more than just a theory of signs of functional equations. An analysis of these families suggest that it is the second moment of the Satake parameters that determines the symmetry group.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.