Seeded PageRank solution paths

DOI10.1017/S0956792516000280zbMath1380.68313arXiv1503.00322OpenAlexW3123252484MaRDI QIDQ4594615

David F. Gleich, Kyle Kloster

Publication date: 24 November 2017

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

social networksrandom walks on graphscomplex networksgraphs and linear algebraprogramming involving graphs or networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items (3)

Network analysis and modelling: Special issue ofEuropean Journal of Applied Mathematics ⋮ A framework for second-order eigenvector centralities and clustering coefficients ⋮ Unnamed Item

Uses Software

• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Graph clustering
• Extrapolation methods for PageRank computations
• Least angle regression. (With discussion)
• PageRank Beyond the Web
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Overlapping community detection in networks
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm

This page was built for publication: Seeded PageRank solution paths