Related papers: Eigenvector localization in real networks and its …
Understanding how age-specific social contact patterns and susceptibility influence infectious disease transmission is crucial for accurate epidemic modeling. This study presents an eigenvector-based sensitivity analysis framework to…
Bipartite graphs are often found to represent the connectivity between the components of many systems such as ecosystems. A bipartite graph is a set of $n$ nodes that is decomposed into two disjoint subsets, having $m$ and $n-m$ vertices…
Let $G$ be a connected graph and let $F$ be a connected subgraph of $G$ with a given structure. We consider that the centrality of a vertex $i$ of $G$ is determined by the centrality of other vertices in all subgraphs contain $i$ and…
We study a simple embedding technique based on a matrix of personalized PageRank vectors seeded on a random set of nodes. We show that the embedding produced by the element-wise logarithm of this matrix (1) are related to the spectral…
We consider $N\times N$ Hermitian random matrices with i.i.d. entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. We study the connection between eigenvalue statistics on…
In the study of disease spreading on empirical complex networks in SIR model, initially infected nodes can be ranked according to some measure of their epidemic impact. The highest ranked nodes, also referred to as "superspreaders", are…
We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…
In this paper, we consider epidemiological networks which are used for modeling the transmission of contagious diseases through a population. Specifically, we study the so-called social sensors problem: given an epidemiological network, can…
We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…
We study a Gaussian matrix function of the adjacency matrix of artificial and real-world networks. In particular, we study the Gaussian Estrada index---an index characterizing the importance of eigenvalues close to zero. This index accounts…
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that compute positions of the nodes of a wireless network on the…
We study the transition between layer-localized and delocalized regimes in a general contact-based contagion model on multiplex networks. Using the inverse participation ratio, we characterize how activity shifts from being confined to a…
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…
The influence of the network's structure on the dynamics of spreading processes has been extensively studied in the last decade. Important results that partially answer this question show a weak connection between the macroscopic behavior…
Spectral radius of a graph $G$ is the largest eigenvalue of adjacency matrix of $G$. The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain respectively the…
Many complex systems can be represented as networks, and how a network breaks up into subnetworks or communities is of wide interest. However, the development of a method to detect nodes important to communities that is both fast and…
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…
In this paper we obtain bounds for the extreme entries of the principal eigenvector of hypergraphs; these bounds are computed using the spectral radius and some classical parameters such as maximum and minimum degrees. We also study…
Using numerical exact diagonalization, we study matrix elements of a local spin operator in the eigenbasis of two different nonintegrable quantum spin chains. Our emphasis is on the question to what extent local operators can be represented…
Several expressions for the $j$-th component $\left( x_{k}\right)_{j}$ of the $k$-th eigenvector $x_{k}$ of a symmetric matrix $A$ belonging to eigenvalue $\lambda_{k}$ and normalized as $x_{k}^{T}x_{k}=1$ are presented. In particular, the…