k -Laplacian Centrality for Simplicial Complexes
Journal of Complex Networks · 10.03.2026 · 14 (2)
DOI: 10.1093/comnet/cnag012 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 21.04.2026. Verfasst von Nalinpat Ponoi und 1 weiteren Autor:innen. Die Arbeit nennt 8 Literaturangaben.
Abstract (Originalsprache)
This work introduces a novel measure of centrality for simplicial complexes of arbitrary dimension $ k $, called $ k $-Laplacian centrality, which extends the concept of Laplacian centrality from graph theory. Through experimentation on real-world data and comparison with existing centrality measures, our findings reveal that $ k $-Laplacian centrality assigns higher centrality to simplices that form the core of dense, cohesive communities.
Zitieren
APA
Ponoi, N., & Montagantirud, P. (2026). k -Laplacian Centrality for Simplicial Complexes. Journal of Complex Networks, 14(2). https://doi.org/10.1093/comnet/cnag012
Vancouver
Ponoi N, Montagantirud P. k -Laplacian Centrality for Simplicial Complexes. Journal of Complex Networks. 2026;14(2). doi:10.1093/comnet/cnag012
BibTeX
@article{Ponoi2026,
author = {Ponoi, Nalinpat and Montagantirud, Pongdate},
title = {k -Laplacian Centrality for Simplicial Complexes},
journal = {Journal of Complex Networks},
year = {2026},
volume = {14},
number = {2},
doi = {10.1093/comnet/cnag012}
}
EUVIMED