Convergence of Random Walks

In course

Sint exercitation do laboris dolore ex laborum dolor ullamco aliqua ea irure. Adipisicing ex dolor fugiat ex eu adipisicing cillum cupidatat cupidatat occaecat exercitation aliqua minim. Eiusmod aliqua esse do occaecat laborum labore. Sit aute nisi magna consectetur do qui tempor commodo officia. Duis consequat sunt commodo voluptate irure veniam ullamco qui reprehenderit adipisicing ea pariatur.

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

https://mediaspace.epfl.ch/media/0_3j2lj5ye

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.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Geometry: Euclidean geometry

Statistics

Statistical inference: Mathematical statistics

Logic

Classical logic: First-order logic

Related lectures (91)