Compartir
Título
Centrality measures in simplicial complexes: Applications of topological data analysis to network science
Autor(es)
Palabras clave
Complex networks
Simplicial complexes
Topological data analysis
Network science
Statistical mechanics
Clasificación UNESCO
12 Matemáticas
Fecha de publicación
2020-10-01
Editor
Elsevier
Citación
Daniel Hernández Serrano, Darío Sánchez Gómez. Centrality measures in simplicial complexes: Applications of topological data analysis to network science, Applied Mathematics and Computation, Volume 382, 2020, 125331, ISSN 0096-3003, https://doi.org/10.1016/j.amc.2020.125331.
Resumen
[EN]Many real networks in social sciences, biological and biomedical sciences or computer science have an inherent structure of simplicial complexes reflecting many-body interactions. Therefore, to analyse topological and dynamical properties of simplicial complex networks centrality measures for simplices need to be proposed. Many of the classical complex networks centralities are based on the degree of a node, so in order to define degree centrality measures for simplices (which would characterise the relevance of a simplicial community in a simplicial network), a different definition of adjacency between simplices is required, since, contrarily to what happens in the vertex case (where there is only upper adjacency), simplices might also have other types of adjacency. The aim of these notes is threefold: first we will use the recently introduced notions of higher order simplicial degrees to propose new degree based centrality measures in simplicial complexes. These theoretical centrality measures, such as the simplicial degree centrality or the eigenvector centrality would allow not only to study the relevance of a simplicial community and the quality of its higher-order connections in a simplicial network, but also they might help to elucidate topological and dynamical properties of simplicial networks; sencond, we define notions of walks and distances in simplicial complexes in order to study connectivity of simplicial networks and to generalise, to the simplicial case, the well known closeness and betweenness centralities (needed for instance to study the relevance of a simplicial community in terms of its ability of transmitting information); third, we propose a new clustering coefficient for simplices in a simplicial network, different from the one knows so far and which generalises the standard graph clustering of a vertex. This measure should be essential to know the density of a simplicial network in terms of its simplicial communities.
URI
ISSN
0096-3003
DOI
10.1016/j.amc.2020.125331
Versión del editor
Aparece en las colecciones
Patrocinador
0096-3003/© 2020 Elsevier Inc. All rights reserved. Publicado bajo acuerdo APC y versión final publicada aquí bajo el permiso del Open Access Support Team de la editorial Elsevier.













