LayerPlexRank: Exploring Node Centrality and Layer Influence through Algebraic Connectivity in Multiplex Networks
As the calculation of centrality in complex networks becomes increasingly vital across technological, biological, and social systems, precise and scalable ranking methods are essential for understanding these networks. This paper introduces LayerPlexRank, an algorithm that simultaneously assesses node centrality and layer influence in multiplex networks using algebraic connectivity metrics. This method enhances the robustness of the ranking algorithm by effectively assessing structural changes across layers using random walk, considering the overall connectivity of the graph. We substantiate the utility of LayerPlexRank with theoretical analyses and empirical validations on varied real-world datasets, contrasting it with established centrality measures.
Code (1)
Similar Papers 제목 키워드 기반
Complex Network Influence Evaluation based on extension of Grueblers Equation
It is greatly significant in evaluating nodes Influence ranking in complex networks. Over the years, many researchers present different measures for quantifying node interconnectedness within networks. Therefore, this pa…
Top influencers can be identified universally by combining classical centralities
Information flow, opinion, and epidemics spread over structured networks. When using individual node centrality indicators to predict which nodes will be among the top influencers or spreaders in a large network, no sing…
Most central or least central? How much modeling decisions influence a node's centrality ranking in multiplex networks
To understand a node's centrality in a multiplex network, its centrality values in all the layers of the network can be aggregated. This requires a normalization of the values, to allow their meaningful comparison and ag…
SensitivityIdentifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis
Identifying important actors (or nodes) in a two-mode network often remains a crucial challenge in mining, analyzing, and interpreting real-world networks. While traditional bipartite centrality indices are often used to…
Exploring the Representational Power of Graph Autoencoder
While representation learning has yielded a great success on many graph learning tasks, there is little understanding behind the structures that are being captured by these embeddings. For example, we wonder if the topol…
ClusteringGraph EmbeddingGraph LearningRepresentation Learning