Efficient hybrid PageRank centrality computation for multilayer networks

Zhao-Li Shen, Yue-Hao Jiao, Yi-Kun Wei, Chun Wen and Bruno Carpentieri

Chaos, Solitons & Fractals, 2025, vol. 192, issue C

Abstract: Quantifying node centrality in multilayer networks is crucial for identifying influential nodes across various applications. Building on the PageRank model for single-layer networks, Lv et al. recently introduced a promising multilayer PageRank model for assessing node and layer centrality. In this paper, we reformulate this model within a discrete Markov chain framework. Our approach incorporates link diversity to enhance centrality measurement and ensures irreducibility within the internal Markov chains. This refinement enables an efficient computational strategy leveraging numerical algebra techniques. Experiments across diverse multilayer networks demonstrate the model’s effectiveness and computational efficiency, particularly for large-scale networks.

Keywords: Multilayer network centrality; Multilayer PageRank model; Efficient computation; Diversity centrality; Gravity centrality (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077925000311
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:192:y:2025:i:c:s0960077925000311

DOI: 10.1016/j.chaos.2025.116018

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().