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-...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of applied mathematics Ročník 27; číslo 6; s. 846 - 887
Hlavní autori:	CUCURINGU, MIHAI, ROMBACH, PUCK, LEE, SANG HOON, PORTER, MASON A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.12.2016
Predmet:	Algorithms Applied mathematics Graphs Matrix Networks low-rank matrix approximations core–periphery structure shortest-path algorithms graph Laplacians
ISSN:	0956-7925, 1469-4425
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!