Three Hypergraph Eigenvector Centralities

DOI10.1137/18M1203031zbMath1499.05432arXiv1807.09644OpenAlexW2963686193WikidataQ127839604 ScholiaQ127839604MaRDI QIDQ5025759

Austin R. Benson

Publication date: 3 February 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.09644

zbMATH Keywords

tensorhypergrapheigenvectorcentralitynetwork science

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (19)

Networks beyond pairwise interactions: structure and dynamics ⋮ Ergodicity Coefficients for Higher-Order Stochastic Processes ⋮ Core-Periphery Detection in Hypergraphs ⋮ Principal eigenvector localization and centrality in networks: revisited ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ Sombor index and degree-related properties of simplicial networks ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors ⋮ Vector centrality in hypergraphs ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices ⋮ The structure and dynamics of networks with higher order interactions ⋮ Quantifying the structural stability of simplicial homology ⋮ A framework for second-order eigenvector centralities and clustering coefficients ⋮ An iterative method for finding the spectral radius of an irreducible nonnegative tensor ⋮ Computing Tensor $Z$-Eigenvectors with Dynamical Systems ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach ⋮ Simplicial complexes and complex systems ⋮ Nonlocal pagerank

Uses Software

• Temporal_Eigenvector_Centrality
• RolX

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Some variational principles for \(Z\)-eigenvalues of nonnegative tensors
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
• An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
• Perron-Frobenius theorem for nonnegative tensors
• Centralities in simplicial complexes. Applications to protein interaction networks
• Real eigenvalues of nonsymmetric tensors
• Directed hypergraphs and applications
• Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
• Eigenvalues of a real supersymmetric tensor
• The centrality index of a graph
• A new status index derived from sociometric analysis
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• PageRank Beyond the Web
• Maximum Block Improvement and Polynomial Optimization
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• Uniqueness of Nonnegative Tensor Approximations
• Network Properties Revealed through Matrix Functions
• Authoritative sources in a hyperlinked environment
• Shifted Power Method for Computing Tensor Eigenpairs
• Functional centrality in graphs
• The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
• Multilinear PageRank
• Finding the Largest Eigenvalue of a Nonnegative Tensor
• The Structure and Function of Complex Networks
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Node and Layer Eigenvector Centralities for Multiplex Networks
• Axioms for Centrality
• Computing Tensor $Z$-Eigenvectors with Dynamical Systems
• The Perron--Frobenius Theorem for Multihomogeneous Mappings
• A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
• An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
• All Real Eigenvalues of Symmetric Tensors
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• Exploring complex networks
• Tensor Analysis
• Most Tensor Problems Are NP-Hard
• Eigenvector-Based Centrality Measures for Temporal Networks
• The Spacey Random Walk: A Stochastic Process for Higher-Order Data

This page was built for publication: Three Hypergraph Eigenvector Centralities