On graph combinatorics to improve eigenvector-based measures of centrality in directed networks

DOI10.1016/J.LAA.2016.04.011MaRDI QIDQ286157zbMATH OpenOpenAlexFDO

Authors Argimiro Arratia, C. Marijuán

Publication date 20 May 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2016.04.011

zbMATH Keywords

networktopologycentralityeigenvectorPageRank

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Stochastic matrices (15B51) Graph theory (05C99)

Recommendations

• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• Some New Results on the Eigenvector Centrality
• A note on a generalization of eigenvector centrality for bipartite graphs and applications
• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph

Cites work

• A new status index derived from sociometric analysis
• Birational equivalence of reduced graphs
• Google's PageRank and beyond. The science of search engine rankings
• Networks. An introduction.

Cited in

(9)

• Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• A measure of centrality based on a reciprocally perturbed Markov chain for asymmetric relations
• A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
• The deformed graph Laplacian and its applications to network centrality analysis
• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• Geometric and spectral analysis on weighted digraphs
• A note on a generalization of eigenvector centrality for bipartite graphs and applications
• Vector centrality in hypergraphs

This page was built for publication: On graph combinatorics to improve eigenvector-based measures of centrality in directed networks

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