English
Related papers

Related papers: Spectral measure for uniform $d$-regular digraphs

200 papers

Let $\mathscr{H}$ be a finite-dimensional complex Hilbert space and $\mathscr{D}$ the set of density matrices on $\mathscr{H}$, i.e., the positive operators with trace 1. Our goal in this note is to identify a probability measure $u$ on…

Quantum Physics · Physics 2022-07-06 Eddy Keming Chen , Roderich Tumulka

The \emph{simplicial rook graph} SR(d,n) is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove that…

Combinatorics · Mathematics 2014-05-06 Jeremy L. Martin , Jennifer D. Wagner

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

Probability · Mathematics 2015-05-27 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

Let G be a graph with set of vertices 1,...,n and adjacency matrix A of size nxn. Let d(i,j)=d, we say that f_d:N->N is a d-function on G if for every pair of vertices i,j and k>=d, we have a_ij^(k)=f_d(k). If this function f_d exists on G…

Combinatorics · Mathematics 2013-04-02 Ernesto Estrada , Jose A. de la Pena

We study random Morse functions on a Riemann manifold $(M^m,g)$ defined as a random Gaussian weighted superpositions of eigenfunctions of the Laplacian of the metric $g$. The randomness is determined by a fixed Schwartz function $w$ and a…

Differential Geometry · Mathematics 2014-03-12 Liviu I. Nicolaescu

Let $G$ be a digraph with adjacency matrix $A(G)$. Let $D(G)$ be the diagonal matrix with outdegrees of vertices of $G$. Nikiforov \cite{Niki} proposed to study the convex combinations of the adjacency matrix and diagonal matrix of the…

Combinatorics · Mathematics 2021-05-25 Weige Xi , Ligong Wang

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

Probability · Mathematics 2024-12-04 Shuyi Wang , Kevin Li , Jiaoyang Huang

We show that for any connected graph $G$ with maximum degree $d\ge3$, the spectral gap from $0$ with respect to the adjacency matrix is at most $\sqrt{d-1}$, with equality if and only if $G$ is the incidence graph of a finite projective…

Combinatorics · Mathematics 2025-10-01 Yuhan Guo , Dong Zhang

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…

Social and Information Networks · Computer Science 2013-02-04 Raj Rao Nadakuditi , M. E. J. Newman

A Laplacian matrix is a square matrix whose row sums are zero. We study the limiting eigenvalue distribution of a Laplacian matrix formed by taking a random elliptic matrix and subtracting the diagonal matrix containing its row sums. Under…

Probability · Mathematics 2023-12-19 Sean O'Rourke , Zhi Yin , Ping Zhong

We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…

Mathematical Physics · Physics 2019-10-09 Mariya Shcherbina , Tatyana Shcherbina

We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…

Probability · Mathematics 2025-11-12 Dang-Zheng Liu , Guangyi Zou

In this short note, we revisit the work of T. Tao and V. Vu on large non-hermitian random matrices with independent and identically distributed entries with mean zero and unit variance. We prove under weaker assumptions that the limit…

Probability · Mathematics 2011-03-01 Charles Bordenave

It is known that every distance-regular digraph is connected and normal. An interesting question is: when is a given connected normal digraph distance-regular? Motivated by this question first we give some characterizations of weakly…

Combinatorics · Mathematics 2013-10-29 G. R. Omidi

We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields…

Probability · Mathematics 2024-06-26 Tatiana Brailovskaya , Ramon van Handel

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

Combinatorics · Mathematics 2009-06-30 F. V. Petrov , A. M. Vershik

We study the spectral norm of N-dimensional hermitian random matrices whose entries are zero outside of the band of the width b along the principal diagonal. Inside this band the elements are given by gaussian centered jointly independent…

Mathematical Physics · Physics 2007-05-23 A. Khorunzhy

We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…

Probability · Mathematics 2007-06-14 Bernard Bercu , Wlodzimierz Bryc

We consider the uniform random $d$-regular graph on $N$ vertices, with $d \in [N^\alpha, N^{2/3-\alpha}]$ for arbitrary $\alpha > 0$. We prove that in the bulk of the spectrum the local eigenvalue correlation functions and the distribution…

Probability · Mathematics 2019-08-21 Roland Bauerschmidt , Jiaoyang Huang , Antti Knowles , Horng-Tzer Yau

We continue the analysis of random series associated to the multidimensional harmonic oscillator $-\Delta + |x|^2$ on $\mathbb{R}^d$ with d \geq 2$$. More precisely we obtain a necessary and sufficient condition to get the almost sure…

Functional Analysis · Mathematics 2025-06-05 Rafik Imekraz , Mickaël Latocca