Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph

DOI10.1080/0022250X.2018.1555827zbMath1485.91191OpenAlexW2904510983WikidataQ128724921 ScholiaQ128724921MaRDI QIDQ5033336

Neng-Pin Lu

Publication date: 22 February 2022

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

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

zbMATH Keywords

principal eigenvectorcentralitybowtie structure

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

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

Uses Software

• Ucinet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of digraphs
• A max version of the Perron-Frobenius theorem
• A new status index derived from sociometric analysis
• PageRank Beyond the Web
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• A Survey on PageRank Computing

This page was built for publication: Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph