TL;DR
This paper introduces the bow-tie centrality, an analytical measure for directed, weighted networks with intrinsic node properties, addressing limitations of existing eigenvector-based centralities, especially in networks with cycles.
Contribution
The paper presents a new, purely analytical bow-tie centrality measure that improves upon existing eigenvector-based measures for complex directed networks with node properties.
Findings
The bow-tie centrality effectively assesses node importance in directed, weighted networks.
It overcomes issues related to cycles in the network that affect traditional measures.
Applied to economic data, it demonstrates comparable relevance assessment with improved robustness.
Abstract
Today, there exist many centrality measures for assessing the importance of nodes in a network as a function of their position and the underlying topology. One class of such measures builds on eigenvector centrality, where the importance of a node is derived from the importance of its neighboring nodes. For directed and weighted complex networks, where the nodes can carry some intrinsic property value, there have been centrality measures proposed that are variants of eigenvector centrality. However, these expressions all suffer from shortcomings. Here, an extension of such centrality measures is presented that remedies all previously encountered issues. While similar improved centrality measures have been proposed as algorithmic recipes, the novel quantity that is presented here is a purely analytical expression, only utilizing the adjacency matrix and the vector of node values. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
