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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer