Core–periphery structure in directed networks

DOI10.1098/rspa.2019.0783zbMath1473.90024arXiv1912.00984OpenAlexW2991136766WikidataQ100649572 ScholiaQ100649572MaRDI QIDQ5161057

Mihai Cucuringu, Marya Bazzi, Angus Chiu, Andrew C. A. Elliott, Gesine D. Reinert

Publication date: 29 October 2021

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00984

zbMATH Keywords

complexitygraph theoryspectral methodslow-rank approximationapplied mathematicsdirected networkscore-periphery

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

Core-periphery models via integer programming: maximizing the influence of the core ⋮ Core-periphery structure in networks: a statistical exposition ⋮ Core–periphery structure in directed networks

Uses Software

• NetworkX
• Scikit
• k-means++
• wbdata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• wbdata
• Disentangling bipartite and core-periphery structure in financial networks
• Authoritative sources in a hyperlinked environment
• Networks
• Detection of core–periphery structure in networks using spectral methods and geodesic paths
• Co-clustering directed graphs to discover asymmetries and directional communities
• Network partition via a bound of the spectral radius
• A Nonlinear Spectral Method for Core--Periphery Detection in Networks
• Core–periphery structure in directed networks
• Multi-way spectral partitioning and higher-order cheeger inequalities

This page was built for publication: Core–periphery structure in directed networks