A biplex approach to PageRank centrality: From classic to multiplex networks
DOI10.1063/1.4952955zbMATH Open1374.68136OpenAlexW2417956450WikidataQ50618129 ScholiaQ50618129MaRDI QIDQ4591844FDOQ4591844
Authors: Francisco Pedroche, Miguel Romance, Regino Criado 
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
Recommendations
- On PageRank versatility for multiplex networks: properties and some useful bounds
- An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept
- Node and Layer Eigenvector Centralities for Multiplex Networks
- Eigenvector centrality of nodes in multiplex networks
- On the spectrum of two-layer approach and multiplex PageRank
- Laplacian centrality: A new centrality measure for weighted networks
- Sharp estimates for the personalized multiplex PageRank
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Searching and sorting (68P10) Network design and communication in computer systems (68M10) Internet topics (68M11)
Cites Work
- A NEW MEASURE OF RANK CORRELATION
- Complex networks: structure and dynamics
- On the localization of the personalized PageRank of complex networks
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
- A new method for comparing rankings through complex networks: model and analysis of competitiveness of major European soccer leagues
- Comparing Partial Rankings
- Adaptive methods for the computation of PageRank
- Title not available (Why is that?)
- Navigability of interconnected networks under random failures
- Eigenvector centrality of nodes in multiplex networks
- A Perron-Frobenius theory for block matrices associated to a multiplex network
- Approximating PageRank from In-Degree
- Random walk centrality in interconnected multilayer networks
Cited In (17)
- On PageRank versatility for multiplex networks: properties and some useful bounds
- Random walks and diffusion on networks
- A new centrality measure of nodes in multilayer networks under the framework of tensor computation
- Enriched line graph: a new structure for searching language collocations
- Identifying mobility patterns by means of centrality algorithms in multiplex networks
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- On the spectrum of two-layer approach and multiplex PageRank
- Sharp estimates for the personalized multiplex PageRank
- Time-dependent personalized PageRank for temporal networks: discrete and continuous scales
- An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept
- Eigenvector centrality of nodes in multiplex networks
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks
- A new centrality measure based on random walks for multilayer networks under the framework of tensor computation
- \textit{m-PageRank}: a novel centrality measure for multilayer networks
- Control of multiple viruses interacting and propagating in multilayer networks
- Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach
This page was built for publication: A biplex approach to PageRank centrality: From classic to multiplex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591844)
