Centrality measures in simplicial complexes: applications of topological data analysis to network science (Q2185435)

Most graph parameters used in complex networks, such as centrality and clustering coefficient, are derived on vertex degree in the graph in question. In various applications, particular those arising in topological data analysis, simplicial complexes are commonly used. This paper makes use of the concept of simplicial degree, introduced in an earlier paper, to bring forth a new concept of centrality measures for simplicial complexes as well as a concept of a clustering coefficient for simplicial complexes, that generalises the classical clustering coefficient in graphs. The paper also introduces walks and distances in simplicial complexes. The aim of these newly introduced concepts is to apply them in various contexts in topological data analysis. The paper contains numerous examples of computations of the new invariants, but no specific applications.