Cargando…

A centrality measure for cycles and subgraphs II

In a recent work we introduced a measure of importance for groups of vertices in a complex network. This centrality for groups is always between 0 and 1 and induces the eigenvector centrality over vertices. Furthermore, its value over any group is the fraction of all network flows intercepted by thi...

Descripción completa

Detalles Bibliográficos
Autores principales: Giscard, Pierre-Louis, Wilson, Richard C.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6214294/
https://www.ncbi.nlm.nih.gov/pubmed/30839787
http://dx.doi.org/10.1007/s41109-018-0064-5