Random matrices with row constraints and eigenvalue distributions of graph Laplacians
نویسندگان
چکیده
Abstract Symmetric matrices with zero row sums occur in many theoretical settings and real-life applications. When the offdiagonal elements of such are i.i.d. random variables large, eigenvalue distributions converge to a peculiar universal curve p_zrs(λ) that looks like cross between Wigner semicircle Gaussian distribution. An analytic theory for this curve, originally due Fyodorov, can be developed using supersymmetry-based techniques.&#xD;&#xD;We extend these derivations case sparse matrices, including important graph Laplacians large graphs N vertices mean degree c. In regime 1<<c<<N , distribution ordinary Laplacian (diffusion fixed transition rate per edge) tends shifted scaled version p_zrs (λ), centered at c width ∼sqrt(c). At smaller c, receives corrections powers 1/sqrt(c) accurately captured by our theory. For normalized vertex), limit is semicircle, again analysis.&#xD;
منابع مشابه
Numerical Methods for Eigenvalue Distributions of Random Matrices
We present efficient numerical techniques for calculation of eigenvalue distributions of random matrices in the beta-ensembles. We compute histograms using direct simulations on very large matrices, by using tridiagonal matrices with appropriate simplifications. The distributions are also obtained by numerical solution of the Painlevé II and V equations with high accuracy. For the spacings we s...
متن کاملRow and Column Distributions of Letter Matrices
A letter matrix is an n-by-n matrix whose entries are n symbols, each appearing n times. The row (column) distribution of a letter matrix is an n-by-n nonnegative integer matrix that tells how many of each letter are in each row (column). A row distribution R and a column distribution C are compatible if there exits a letter matrix A whose row distribution is R and whose column distribution is ...
متن کاملRow Products of Random Matrices
Let ∆1, . . . ,∆K be d × n matrices. We define the row product of these matrices as a d × n matrix, whose rows are entry-wise products of rows of ∆1, . . . ,∆K . This construction arises in certain computer science problems. We study the question, to which extent the spectral and geometric properties of the row product of independent random matrices resemble those properties for a d × n matrix ...
متن کاملLarge Random Matrices: Eigenvalue Distribution
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 universal, is recovered and the three and four-point functions are given explicitly. One observes that higher order correlation functions are linear combinations of u...
متن کاملSturm Sequences and Random Eigenvalue Distributions
This paper proposes that the study of Sturm sequences is invaluable in the numerical computation and theoretical derivation of eigenvalue distributions of random matrix ensembles. We first explore the use of Sturm sequences to efficiently compute histograms of eigenvalues for symmetric tridiagonal matrices and apply these ideas to random matrix ensembles such as the β-Hermite ensemble. Using ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2023
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/acdcd3