Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
Bibliographic Data
| ID | 10142712 |
|---|---|
| Authors | Neng‐Pin Lu (0000-0002-4310-4171, Chang Gung University, corresponding author), Neng-Pin Lu (Chang Gung University) |
| Year | 2017 |
| Volume | 41 |
| Issue | 3 |
| Pages | 139-154 |
| Publication date | 2017-06-07 |
| Open Access | No |
| Type | ARTICLE |
| Venue | Journal of Mathematical Sociology (JOURNAL) |
| Journal identifiers | ISSN: 0022-250X • E-ISSN: 1545-5874 |
| Publisher | Taylor & Francis (PUBLISHER • GB) |
| DOI | 10.1080/0022250x.2017.1328680 |
| OpenAlex | W2622285752 |
| Language | EN |
| Citations received | 3 |
| References cited | 16 |
Eigenvector centrality is a popular measure that uses the principal eigenvector of the adjacency matrix to distinguish importance of nodes in a graph. To find the principal eigenvector, the power method iterating from a random initial vector is often adopted. In this article, we consider the adjacency matrix of a directed graph and choose suitable initial vectors according to strongly connected components of the graph instead so that nonnegative eigenvectors, including the principal one, can be found. Consequently, for aggregating nonnegative eigenvectors, we propose a weighted measure of centrality, called the aggregated-eigenvector centrality. Weighting each nonnegative eigenvector by the reachability of the associated strongly connected component, we can obtain a measure that follows a status hierarchy in a directed graph
Adjacency matrix · Centrality · Combinatorics · Data mining · Discrete mathematics · Eigenvalues and eigenvectors · Generalized eigenvector · Graph · Graph energy · Graph power · Line graph · Measure (data warehouse · Regular graph · Symmetric matrix · Weighting · Complex Network Analysis Techniques · Computer Science · Graph theory and applications · Mathematics · Opinion Dynamics and Social Influence
Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations
A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
A New Status Index Derived from Sociometric Analysis
Centrality in social networks conceptual clarification
Eigenvector-like measures of centrality for asymmetric relations
Social Networks of Drug Users in High-Risk Sites
An Input-Output Approach to Clique Identification
Factoring and weighting approaches to status scores and clique identification
The Origins of Status Hierarchies
Theoretical Foundations for Centrality Measures
Power and Centrality
| Citations per year | 0.38 |
|---|---|
| Citation span | 2018 - 2021 (4) |
| Highly cited | No |