On the localization of the personalized PageRank of complex networks

DOI10.1016/j.laa.2012.10.051zbMath1282.91277arXiv1206.4855OpenAlexW2137918542MaRDI QIDQ2435365

Esther García, Francisco Pedroche, Miguel Romance

Publication date: 19 February 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.4855

zbMATH Keywords

PageRanklink analysisGoogle matrix

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Canonical forms, reductions, classification (15A21)

Related Items (10)

Enriched line graph: a new structure for searching language collocations ⋮ Sharp estimates for the personalized multiplex PageRank ⋮ A biplex approach to PageRank centrality: From classic to multiplex networks ⋮ Network Capacity Bound for Personalized PageRank in Multimodal Networks ⋮ Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ On graphs associated to sets of rankings ⋮ A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues ⋮ On the edges’ PageRank and line graphs ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach

Cites Work

• Unnamed Item
• Unnamed Item
• Competitivity groups on social network sites
• Choosing a leader on a complex network
• Random walk with restart: fast solutions and applications
• Leadership groups on social network sites based on personalized PageRank
• Quick Detection of Top-k Personalized PageRank Lists

This page was built for publication: On the localization of the personalized PageRank of complex networks