相关论文: Non-backtracking spectra of weighted inhomogeneous…

Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding (NOBE), which offers a new perspective that organizes graph…

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…

Decelle et al.\cite{Decelle11} conjectured the existence of a sharp threshold for community detection in sparse random graphs drawn from the stochastic block model. Mossel et al.\cite{Mossel12} established the negative part of the…

We study finite-rank normal deformations of rotationally invariant non-Hermitian random matrices. Extending the classical Baik-Ben Arous-P\'ech\'e (BBP) framework, we characterize the emergence and fluctuations of outlier eigenvalues in…

Given two networks of differing sizes, it is of interest to test whether the two networks belong to the same distribution. We formalize the notion of "equality of distribution" under the framework of the generalized random dot product…

We propose a Bayesian approach, called the posterior spectral embedding, for estimating the latent positions in random dot product graphs, and prove its optimality. Unlike the classical spectral-based adjacency/Laplacian spectral embedding,…

This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…

Kernel-based random graphs (KBRGs) are a broad class of random graph models that account for inhomogeneity among vertices. We consider KBRGs on a discrete $d-$dimensional torus $\mathbf{V}_N$ of size $N^d$. Conditionally on an…

Random-matrix theory is applied to transition-rate matrices in the Pauli master equation. We study the distribution and correlations of eigenvalues, which govern the dynamics of complex stochastic systems. Both the cases of identical and of…

We analyze the invariant distributions of continuous-time and discrete-time random walks on randomly weighted complete digraphs. These distributions correspond to the principal left eigenvectors of the associated random Markov generators…

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

In the case of graph partitioning, the emergence of localized eigenvectors can cause the standard spectral method to fail. To overcome this problem, the spectral method using a non-backtracking matrix was proposed. Based on numerical…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

We develop a theoretical approach to compute the conditioned spectral density of $N \times N$ non-invariant random matrices in the limit $N \rightarrow \infty$. This large deviation observable, defined as the eigenvalue distribution…

Whether comparing networks to each other or to random expectation, measuring dissimilarity is essential to understanding the complex phenomena under study. However, determining the structural dissimilarity between networks is an ill-defined…

The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…

Previous literature on random matrix and network science has traditionally employed measures derived from nearest-neighbor level spacing distributions to characterize the eigenvalue statistics of random matrices. This approach, however,…

We study the asymptotic rank of adjacency matrices of a large class of edge-weighted configuration models. Here, the weight of a (multi-)edge can be any fixed non-zero element from an arbitrary field, as long as it is independent of the…

Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…

We introduce a powerful analytic method to study the statistics of the number $\mathcal{N}_{\textbf{A}}(\gamma)$ of eigenvalues inside any contour $\gamma \in \mathbb{C}$ for infinitely large non-Hermitian random matrices ${\textbf A}$. Our…