Detection of core–periphery structure in networks using spectral methods and geodesic paths

We introduce several novel and computationally efficient methods for detecting “core–periphery structure” in networks. Core–periphery structure is a type of mesoscale structure that consists of densely connected core vertices and sparsely connected peripheral vertices. Core vertices tend to be well-...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of applied mathematics Jg. 27; H. 6; S. 846 - 887
Hauptverfasser:	CUCURINGU, MIHAI, ROMBACH, PUCK, LEE, SANG HOON, PORTER, MASON A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.12.2016
Schlagworte:	Algorithms Applied mathematics Graphs Matrix Networks low-rank matrix approximations core–periphery structure shortest-path algorithms graph Laplacians
ISSN:	0956-7925, 1469-4425
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!