A biplex approach to PageRank centrality: From classic to multiplex networks

DOI10.1063/1.4952955zbMath1374.68136OpenAlexW2417956450WikidataQ50618129 ScholiaQ50618129MaRDI QIDQ4591844

Francisco Pedroche, Regino Criado, Miguel Romance

Publication date: 17 November 2017

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/80624

Mathematics Subject Classification ID

Searching and sorting (68P10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Related Items (10)

Enriched line graph: a new structure for searching language collocations ⋮ A new centrality measure based on random walks for multilayer networks under the framework of tensor computation ⋮ An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept ⋮ Sharp estimates for the personalized multiplex PageRank ⋮ Random walks and diffusion on networks ⋮ Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ A new centrality measure of nodes in multilayer networks under the framework of tensor computation ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach ⋮ Control of multiple viruses interacting and propagating in multilayer networks

Cites Work

• Unnamed Item
• Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
• A Perron-Frobenius theory for block matrices associated to a multiplex network
• Adaptive methods for the computation of PageRank
• Random walk centrality in interconnected multilayer networks
• Complex networks: structure and dynamics
• On the localization of the personalized PageRank of complex networks
• A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues
• Navigability of interconnected networks under random failures
• Eigenvector centrality of nodes in multiplex networks
• Approximating PageRank from In-Degree
• Comparing Partial Rankings
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: A biplex approach to PageRank centrality: From classic to multiplex networks