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.1555827zbMATH Open1485.91191OpenAlexW2904510983WikidataQ128724921 ScholiaQ128724921MaRDI QIDQ5033336FDOQ5033336

Authors: 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

Recommendations

• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• Some New Results on the Eigenvector Centrality
• Centrality measures for node-weighted networks via line graphs and the matrix exponential

zbMATH Keywords

centralityprincipal eigenvectorbowtie structure

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new status index derived from sociometric analysis
• Title not available (Why is that?)
• Google's PageRank and beyond. The science of search engine rankings
• A Survey on PageRank Computing
• Spectra of digraphs
• PageRank beyond the web
• A max version of the Perron-Frobenius theorem
• Combinatorial scientific computing.
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph

Cited In (4)

• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
• 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 chain for asymmetric relations

Uses Software

• Ucinet

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

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