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

DOI10.1016/j.laa.2016.04.011zbMath1338.15068OpenAlexW2337993075MaRDI QIDQ286157

Carlos Marijuán, Argimiro A. Arratia

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

networkeigenvectortopologycentralityPageRank

Mathematics Subject Classification ID

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

Related Items

Geometric and spectral analysis on weighted digraphs ⋮ The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis

Cites Work

• Unnamed Item
• Birational equivalence of reduced graphs
• A new status index derived from sociometric analysis
• Networks