A divide-and-conquer algorithm for core-periphery identification in large networks

DOI10.1002/sta4.475MaRDI QIDQ6543929

Eric Yanchenko

Publication date: 27 May 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

networksstatistical computinglarge and complex data sets

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• On statistics, computation and scalability
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Sparse networks with core-periphery structure
• The centrality index of a graph
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• An Efficient Heuristic Procedure for Partitioning Graphs
• Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
• Networks
• Multi-Scale attributed node embedding
• Machine Learning: ECML 2004

This page was built for publication: A divide-and-conquer algorithm for core-periphery identification in large networks