Walking Randomly, Massively, and Efficiently
Offered By: Association for Computing Machinery (ACM) via YouTube
Course Description
Overview
Explore the concept of random walks and their applications in this insightful conference talk. Delve into the construction of random walks and their connection to PageRank algorithms. Examine rejection probability, undirected edges, and the process of dividing by degree. Gain a deeper understanding of how PageRank utilizes random walks to efficiently analyze and rank interconnected data structures.
Syllabus
Introduction
Constructing Random Walks
Page Rank
Rejection Probability
Undirected Edges
Dividing by Degree
Using Page Rank
Taught by
Association for Computing Machinery (ACM)
Related Courses
An Introduction to Computer NetworksStanford University via Independent Introduction to Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Network Analysis in Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Networks, Crowds and Markets
Cornell University via edX Networking Leadership 101: Building Your Core Professional Network
Center for Creative Leadership via Acumen Academy