Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph

DOI10.1080/0022250X.2017.1328680MaRDI QIDQ4963386zbMATH OpenOpenAlexFDO

Authors Neng-Pin Lu

Publication date 2 November 2018

Published in The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0022250x.2017.1328680

zbMATH Keywords

nonnegative eigenvectorpower methodstrongly connected component

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Social networks; opinion dynamics (91D30)

Recommendations

• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• Eigenvector centralization as a measure of structural bias in information aggregation
• Some New Results on the Eigenvector Centrality
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks

Cites work

• A max version of the Perron-Frobenius theorem
• A new status index derived from sociometric analysis
• Depth-First Search and Linear Graph Algorithms
• Google's PageRank and beyond. The science of search engine rankings
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• On Estimating the Largest Eigenvalue with the Lanczos Algorithm
• Spectra of digraphs

Cited in

(9)

• Axioms for centrality scoring with principal eigenvectors
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
• A note on a generalization of eigenvector centrality for bipartite graphs and applications
• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• Eigenvector centralization as a measure of structural bias in information aggregation
• A measure of centrality based on a reciprocally perturbed Markov chain for asymmetric relations
• Some New Results on the Eigenvector Centrality
• Eigenvector components of symmetric, graph-related matrices

This page was built for publication: Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963386)