Related papers: Spectral distributions of adjacency and Laplacian …
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…
We compare the spectrum and the localisation properties of the eigenmodes of the Laplacian and the adjacency matrix of 2D random geometric graphs, using numerical diagonalization of these matrices for different system sizes and…
In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…
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…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
In this paper we study the local law for eigenvalues of large random regular bipartite graphs with degree growing arbitrarily fast. We prove that the empirical spectral distribution of the adjacency matrix converges to a scaled down copy of…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We study adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi $r$-uniform hypergraphs on $n$ vertices with hyperedge inclusion probability $p$, in the setting where $r$ can vary with $n$ such that $r / n \to c \in [0, 1)$. Adjacency…
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…
We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…
We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…
We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, 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…
We investigate the spectral distribution of random matrix ensembles with correlated entries. We consider symmetric matrices with real valued entries and stochastically independent diagonals. Along the diagonals the entries may be…