Lecture
Random Walker Model: PageRank
Related lectures (34)
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Influence: Social Interaction and Online Metrics
Discusses social influence, online metrics, Page Rank, and the impact of money.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Link-based Ranking: Fundamentals and Algorithms
Covers the fundamentals and algorithms of link-based ranking, including anchor text indexing, PageRank, HITS, and practical implementations.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Algorithmic Paradigms for Dynamic Graph Problems
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Link-based ranking: PageRank & HITS
Explores link-based ranking through PageRank and HITS algorithms, covering practical examples and challenges in web search and ranking methods.
Epidemic Spreading Models
Covers classical models of epidemic spreading and dynamics on networks with examples.
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.