An official website of the United States government
We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a bipartite block structure. We obtain probabilistic upper (respectively, lower) bounds for the largest (respectively, smallest) singular values of a large rectangular random matrix X. These bounds are given in terms of the maximal and minimal 2-norms of the rows and columns of the variance profile of X. The proofs involve finding probabilistic upper bounds on the spectral radius of an associated non-backtracking matrix B. The two-sided bounds can be applied to the centered adjacency matrix of sparse inhomogeneous Erd˝os-Rényi bipartite graphs for a wide range of sparsity, down to criticality. In particular, for Erd˝os-Rényi bipartite graphs G(n,m, p) with p = ω(log n)/n, and m/n→ y ∈ (0,1), our sharp bounds imply that there are no outliers outside the support of the Marˇcenko-Pastur law almost surely. This result extends the Bai-Yin theorem to sparse rectangular random matrices.
more »
« less
A graphon approach to limiting spectral distributions of Wigner‐type matrices
We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner‐type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes transforms explicitly with weaker assumptions on the convergence of variance profiles than previous results. As applications, we give a new proof of the semicircle law for generalized Wigner matrices and determine the limiting spectral distributions for three sparse inhomogeneous random graph models with sparsityω(1/n): inhomogeneous random graphs with roughly equal expected degrees,W‐random graphs and stochastic block models with a growing number of blocks. Furthermore, we show our theorems can be applied to random Gram matrices with a variance profile for which we can find the limiting spectral distributions under weaker assumptions than previous results.
more »
« less
- Award ID(s):
- 1949617
- PAR ID:
- 10122093
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Random Structures & Algorithms
- Volume:
- 56
- Issue:
- 1
- ISSN:
- 1042-9832
- Page Range / eLocation ID:
- p. 251-279
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Consider a set of n vertices, where each vertex has a location in $$\mathbb{R}^d$$ that is sampled uniformly from the unit cube in $$\mathbb{R}^d$$ , and a weight associated to it. Construct a random graph by placing edges independently for each vertex pair with a probability that is a function of the distance between the locations and the vertex weights. Under appropriate integrability assumptions on the edge probabilities that imply sparseness of the model, after appropriately blowing up the locations, we prove that the local limit of this random graph sequence is the (countably) infinite random graph on $$\mathbb{R}^d$$ with vertex locations given by a homogeneous Poisson point process, having weights which are independent and identically distributed copies of limiting vertex weights. Our set-up covers many sparse geometric random graph models from the literature, including geometric inhomogeneous random graphs (GIRGs), hyperbolic random graphs, continuum scale-free percolation, and weight-dependent random connection models. We prove that the limiting degree distribution is mixed Poisson and the typical degree sequence is uniformly integrable, and we obtain convergence results on various measures of clustering in our graphs as a consequence of local convergence. Finally, as a byproduct of our argument, we prove a doubly logarithmic lower bound on typical distances in this general setting.more » « less
-
We consider m independent random rectangular matrices whose entries are independent and identically distributed standard complex Gaussian random variables. Assume the product of the m rectangular matrices is an n-by-n square matrix. The maximum absolute value of the n eigenvalues of the product matrix is called spectral radius. In this paper, we study the limiting spectral radii of the product when m changes with n and can even diverge. We give a complete description for the limiting distribution of the spectral radius. Our results reduce to those in Jiang and Qi (J Theor Probab 30(1):326–364, 2017) when the rectangular matrices are square.more » « less
-
The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233–1260, 2016; Commun Math Phys 351:1009–1044, 2017). We consider random Hermitian block band matrices consisting of $$W\times W$$ random Gaussian blocks (parametrized by $$j,k \in\Lambda=[1,n]^d\cap \mathbb{Z}^d$$) with a fixed entry's variance $$J_{jk}=\delta_{j,k}W^{-1}+\beta\Delta_{j,k}W^{-2}$$, $$\beta>0$$ in each block. Taking the limit $$W\to\infty$$ with fixed $$n$$ and $$\beta$$, we derive the sigma-model approximation of the second correlation function similar to Efetov's one. Then, considering the limit $$\beta, n\to\infty$$, we prove that in the dimension $d=1$ the behaviour of the sigma-model approximation in the bulk of the spectrum, as $$\beta\gg n$$, is determined by the classical Wigner -- Dyson statistics.more » « less
-
Bellwied, R; Geurts, F; Rapp, R; Ratti, C; Timmins, A; Vitev, I (Ed.)The thermodynamicT-matrix approach is used to study Wilson line correlators (WLCs) for a static quark-antiquark pair in the quark-gluon plasma (QGP). Selfconsistent results that incorporate constraints from the QGP equation of state can approximately reproduce WLCs computed in 2+1-flavor lattice-QCD (lQCD), provided the input potential exhibits less screening than in previous studies. Utilizing the updated potential to calculate pertinent heavylightT-matrices we evaluate thermal relaxation rates of heavy quarks in the QGP. We find a more pronounced temperature dependence for low-momentum quarks than in our previous results (with larger screening), which turns into a weaker temperature dependence of the (temperature-scaled) spatial diffusion coefficient, in fair agreement with the most recent lQCD data.more » « less
