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

DOI10.1080/0022250X.2017.1328680zbMath1417.91411OpenAlexW2622285752MaRDI QIDQ4963386

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

power methodstrongly connected componentnonnegative eigenvector

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ A measure of centrality based on a reciprocally perturbed Markov chainfor asymmetric relations

Cites Work

• Spectra of digraphs
• A max version of the Perron-Frobenius theorem
• A new status index derived from sociometric analysis
• On Estimating the Largest Eigenvalue with the Lanczos Algorithm
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item

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