The mathematics of internet search engines

DOI10.1007/s10440-008-9254-yzbMath1184.68174OpenAlexW2151646120MaRDI QIDQ1014846

Fredrik Andersson, Sergei D. Silvestrov

Publication date: 29 April 2009

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-008-9254-y

zbMATH Keywords

rankingMarkov chainsinformation retrievalpower seriessearch enginespower methodPageRanktext indexingcitation ranking

Mathematics Subject Classification ID

Searching and sorting (68P10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Generalisation of the Damping Factor in PageRank for Weighted Networks ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph ⋮ Hitting times in Markov chains with restart and their application to network centrality ⋮ Perturbed Markov chains with damping component ⋮ PageRank for networks, graphs, and Markov chains ⋮ Coupling and ergodic theorems for Markov chains with damping component

Cites Work

• A Mathematical Theory of Communication
• Adaptive methods for the computation of PageRank
• Authoritative sources in a hyperlinked environment
• Deeper Inside PageRank
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item