The paper generalizes graph centrality measures to simplicial complexes using the authors' prior higher-order adjacency framework, but the proposed normalizations contain a binomial counting error.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AT 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Centrality measures in simplicial complexes: applications of Topological Data Analysis to Network Science
The paper generalizes graph centrality measures to simplicial complexes using the authors' prior higher-order adjacency framework, but the proposed normalizations contain a binomial counting error.