A Principal Component Analysis Framework for Characterizing Core-Periphery Structures through Neighborhood-Based Bridge Node Centrality
DOI:
https://doi.org/10.55640/ijnget-v02i09-01Keywords:
Network Science, Core-Periphery Structure, Principal Component Analysis (PCA)Abstract
Background: The core-periphery (C-P) structure is a fundamental feature of complex networks, yet its characterization remains a significant challenge. Existing methods often impose a discrete partition on the network, classifying nodes as either core or periphery, which oversimplifies the diverse and continuous roles nodes can play.
Methods: We propose a novel framework for a more nuanced C-P characterization. First, we introduce a "Neighborhood-based Bridge Node Centrality" metric, designed to quantify the extent to which a node connects its local neighborhood to the wider network. We then apply Principal Component Analysis (PCA) to a node-feature matrix derived from this metric. The resulting principal components provide a low-dimensional embedding where nodes are positioned based on their topological roles. A clustering algorithm is then used on this embedding to identify core, periphery, and intermediate structures.
Results: On synthetic networks with known C-P structures, our framework demonstrates high accuracy. When applied to real-world networks, including a jazz musician collaboration network, it reveals a continuous spectrum of "coreness" and effectively identifies bridge nodes that are critical for network cohesion. A comparative analysis shows our method provides a richer characterization than traditional approaches based on discrete optimization and spectral methods.
Conclusion: The proposed PCA framework offers a flexible, interpretable, and powerful tool for analyzing core-periphery structures. By moving beyond a binary classification, it provides deeper insights into the complex topology of networks, with significant implications for understanding dynamics like influence spreading and system resilience.
References
Barbera, P., Wang, N., Bonneau, R., Jost, J. T., Nagler, J., Tucker, J., Gonzalez Bailon, S. (2015). The Critical Periphery in the Growth of Social Protests. PLoS ONE, 0143611, 1-15. https://doi.org/10.1371/journal.pone.0143611
Batagelj, V., Mrvar, A. (2006). Pajek Datasets. Retrieved from http://vlado.fmf.uni-lj.si/pub/networks/data/
Borgatti, S. P., Everett, M. G. (2000). Models of Core/Periphery Structures. Social Networks, 21(4), 375-395. https://doi.org/10.1016/S0378-8733(99)00019-2
Cadrillo, A., Gomez Gardenes, J., Zanin, M., Romance, M., Papo, D., Pozo, F., Boccaletti, S. (2013). Emergence of Network Features from Multiplexity. Scientific Reports, 3(1344), 1-6. https://doi.org/10.1038/srep01344
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms (4th ed.). MIT Press.
Cucuringu, M., Rombach, P., Lee, S. H., Porter, M. A. (2016). Detection of Core Periphery Structure in Networks using Spectral Methods and Geodesic Paths. European Journal of Applied Mathematics, 27, 846-887. https://doi.org/10.1017/S095679251600022X
De Domenico, M., Sole Ribalta, A., Gomez, S., Areans, A. (2014). Navigability of Interconnected Networks under Random Failures. Proceedings of the National Academy of Sciences, 111, 8351-8356. https://doi.org/10.1073/pnas.1318469111
Della Rossa, F., Dercole, F., Piccardi, C. (2013). Profiling Core Periphery Network Structure by Random Walkers. Scientific Reports, 3(1467), 1-8. https://doi.org/10.1038/srep01467
Gallagher, R. J., Young, J. G., Welles, B. F. (2021). A Clarified Typology of Core Periphery Structure in Networks. Science Advances, 7(12), eabc9800, 1-11. https://doi.org/10.1126/sciadv.abc9800
Geiser, P., & Danon, L. (2003). Community Structure in Jazz. Advances in Complex Systems, 6, 565-573. https://doi.org/10.1142/S0219525903001067
Gephi, (2011). Retrieved from https://gephi.org/tutorials/gephi_tutorial_layouts.pdf
Hashler, M., Peienbrock, M., Doran, D. (2019). dbscan: Fast Density based Clustering with R. Journal of Statistical Software, 91(1), 1-30. https://doi.org/10.18637/jss.v091.i01
Inza, E. P., Vakhania, N., Sigatreta, J. M., Mira, F. A. H. (2023). Exact and Heuristic Algorithms for the Domination Problem. European Journal of Operational Research, 313(2), 1-30. https://doi.org/10.1016/j.ejor.2023.08.033
Jolliffe, I. T. (2002). Principal Component Analysis (1st Ed.). Springer Series in Statistics.
Kitsak, M., Gallos, L. K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H. E., Makse, H. A. (2010). Identification of Influential Spreaders in Complex Networks. Nature Physics, 6(11), 888-893. https://doi.org/10.1038/nphys1746
Knuth, D. E. (1993). The Stanford GraphBase A Platform for Combinatorial Computing (1st Ed.). Addison Wesley.
Kojaku, S., Masuda, N. (2017). Finding Multiple Core Periphery Pairs in Networks. Physical Review E, 96, 052313. https://doi.org/10.1103/PhysRevE.96.052313
Lloyd, S. (1982). Least Squares Quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129-137. https://doi.org/10.1109/TIT.1982.1056489
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Dr. Miguel A. Rodríguez (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain the copyright of their manuscripts, and all Open Access articles are disseminated under the terms of the Creative Commons Attribution License 4.0 (CC-BY), which licenses unrestricted use, distribution, and reproduction in any medium, provided that the original work is appropriately cited. The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.