Three hypergraph eigenvector centralities
From MaRDI portal
Abstract: Eigenvector centrality is a standard network analysis tool for determining the importance of (or ranking of) entities in a connected system that is represented by a graph. However, many complex systems and datasets have natural multi-way interactions that are more faithfully modeled by a hypergraph. Here we extend the notion of graph eigenvector centrality to uniform hypergraphs. Traditional graph eigenvector centralities are given by a positive eigenvector of the adjacency matrix, which is guaranteed to exist by the Perron-Frobenius theorem under some mild conditions. The natural representation of a hypergraph is a hypermatrix (colloquially, a tensor). Using recently established Perron-Frobenius theory for tensors, we develop three tensor eigenvectors centralities for hypergraphs, each with different interpretations. We show that these centralities can reveal different information on real-world data by analyzing hypergraphs constructed from n-gram frequencies, co-tagging on stack exchange, and drug combinations observed in patient emergency room visits.
Recommendations
- Comparing the principal eigenvector of a hypergraph and its shadows
- Eigenvector centrality of nodes in multiplex networks
- A note on a generalization of eigenvector centrality for bipartite graphs and applications
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Some New Results on the Eigenvector Centrality
Cites work
- A new status index derived from sociometric analysis
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
- All real eigenvalues of symmetric tensors
- An adaptive shifted power method for computing generalized tensor eigenpairs
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Authoritative sources in a hyperlinked environment
- Axioms for Centrality
- Centralities in simplicial complexes. Applications to protein interaction networks
- Computing tensor Z-eigenvectors with dynamical systems
- Directed hypergraphs and applications
- Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
- Eigenvalues of a real supersymmetric tensor
- Eigenvector-based centrality measures for temporal networks
- Exploring complex networks
- Finding the largest eigenvalue of a nonnegative tensor
- Functional centrality in graphs
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Maximum block improvement and polynomial optimization
- Most tensor problems are NP-hard
- Multilinear PageRank
- Network properties revealed through matrix functions
- Node and Layer Eigenvector Centralities for Multiplex Networks
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the limiting behavior of parameter-dependent network centrality measures
- PageRank beyond the web
- Perron-Frobenius theorem for nonnegative tensors
- Real eigenvalues of nonsymmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Some variational principles for \(Z\)-eigenvalues of nonnegative tensors
- Tensor analysis. Spectral theory and special tensors
- Tensor Decompositions and Applications
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- The centrality index of a graph
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- The Perron--Frobenius Theorem for Multihomogeneous Mappings
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- The Structure and Function of Complex Networks
- Uniqueness of Nonnegative Tensor Approximations
Cited in
(37)- An iterative method for finding the spectral radius of an irreducible nonnegative tensor
- Principal eigenvector localization and centrality in networks: revisited
- Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
- Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
- Depth-based hypergraph complexity traces from directed line graphs
- Sombor index and degree-related properties of simplicial networks
- Vector centrality in hypergraphs
- A note on a generalization of eigenvector centrality for bipartite graphs and applications
- Nonlocal pagerank
- Ergodicity Coefficients for Higher-Order Stochastic Processes
- Hypergraph Cuts with General Splitting Functions
- A framework for second-order eigenvector centralities and clustering coefficients
- Computing tensor Z-eigenvectors with dynamical systems
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach
- Simplicial complexes and complex systems
- Core-Periphery Detection in Hypergraphs
- Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors
- Multi-linear pseudo-PageRank for hypergraph partitioning
- The structure and dynamics of networks with higher order interactions
- Comparing the principal eigenvector of a hypergraph and its shadows
- Quantifying the structural stability of simplicial homology
- Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications
- Influence maximization based on threshold models in hypergraphs
- Eigenvector centrality in simplicial complexes of hypergraphs
- Hypergraph assortativity: a dynamical systems perspective
- Vital node identification in hypergraphs via gravity model
- Scalable tensor methods for nonuniform hypergraphs
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Kronecker product of tensors and hypergraphs: structure and dynamics
- Centrality measures to control epidemic spreading on uniform hypergraphs or hypernetworks
- Accelerating the computation of tensor Z-eigenvalues
- Clique based centrality measure in hypergraphs
- Largest and least H-eigenvalues of symmetric tensors and hypergraphs
- A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries
- Multilinear hyperquiver representations
- Quantum estimates for classical polynomial optimization
- Networks beyond pairwise interactions: structure and dynamics
This page was built for publication: Three hypergraph eigenvector centralities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025759)
