Related papers: Eigenvalue Distribution of Large Weighted Random S…
We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
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…
Consider the ensemble of Real Symmetric Toeplitz Matrices, each entry iidrv from a fixed probability distribution p of mean 0, variance 1, and finite higher moments. The limiting spectral measure (the density of normalized eigenvalues)…
Let $Q$ be an $s$-vertex $r$-uniform hypergraph, and let $H$ be an $n$-vertex $r$-uniform hypergraph. Denote by $\mathcal{N}(Q,H)$ the number of isomorphic copies of $Q$ in $H$. For a hereditary family $\mathcal{P}$ of $r$-uniform…
In this article, we consider eigenvector centrality for the nodes of a graph and study the robustness (and stability) of this popular centrality measure. For a given weighted graph {\mathcal G} (both directed and undirected), we consider…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
In the article we study the Neumann $(p,q)$-eigenvalue problems in bounded H\"older $\gamma$-singular domains $\Omega_{\gamma}\subset \mathbb{R}^n$. In the case $1<p<\infty$ and $1<q<p^{*}_{\gamma}$ we prove solvability of this eigenvalue…
The density of complex eigenvalues of random asymmetric $N\times N$ matrices is found in the large-$N$ limit. The matrices are of the form $H_0+A$ where $A$ is a matrix of $N^2$ independent, identically distributed random variables with…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear…
Real eigenpairs of a real antisymmetric tensor of order $p$ and dimension $N$ can be defined as pairs of a real eigenvalue and $p$ orthonormal $N$-dimensional real eigenvectors. We compute the signed and the genuine distributions of such…
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.
Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…
In the current work we are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. When $\Omega=[0,1]$, such graphs include the standard Toeplitz…
The distribution of eigenvalues of N times N random matrices in the limit N to infinity is the solution to a variational principle that determines the ground state energy of a confined fluid of classical unit charges. This fact is a…
In this paper, we consider a data matrix $X_N\in\mathbb{R}^{N\times p}$ where all the rows are i.i.d. samples in $\mathbb{R}^p$ of mean zero and covariance matrix $\Sigma\in\mathbb{R}^{p\times p}$. Here the population matrix $\Sigma$ is of…
We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies reveal that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes…