Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This lecture covers computing measures over large networks, sampling, random walks on graphs, handling degree and locality bias, conductance bound, epidemics, unbiased estimators from random walks, transient analysis, mixing time, and epidemic models in social and information networks.