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

Full description

Bibliographic Details

Published in:	European journal of applied mathematics Vol. 27; no. 6; pp. 846 - 887
Main Authors:	CUCURINGU, MIHAI, ROMBACH, PUCK, LEE, SANG HOON, PORTER, MASON A.
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.12.2016
Subjects:	Algorithms Applied mathematics Graphs Matrix Networks low-rank matrix approximations core–periphery structure shortest-path algorithms graph Laplacians
ISSN:	0956-7925, 1469-4425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!