Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Convergence of Random Walks
Description
This lecture covers the convergence of random walks, focusing on the weight of edges, weighted adjacency matrices, and eigenvectors. It explores the conductance of edges, stationary distributions, and the properties of random walks on graphs.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.