Course

COM-516: Markov chains and algorithmic applications

Summary

The study of random walks finds many applications in computer science and communications. The goal of the course is to get familiar with the theory of random walks, and to get an overview of some applications of this theory to problems of interest in communications, computer and network science.

Official source

https://edu.epfl.ch/coursebook/en/markov-chains-and-algorithmic-applications-COM-516

Moodle Page

http://go.epfl.ch/COM-516

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

Algebra: Linear algebra

Discrete mathematics: Graph theory

Statistics

Statistical inference: Mathematical statistics, Bayesian inference

Instructors (2)

Lectures in this course (34)

consequat ipsum voluptate EPFL-123: nisi amet adipisicing adipisicing

Anim proident irure voluptate nisi reprehenderit consequat amet. Et laborum et amet reprehenderit eiusmod dolore minim qui nisi voluptate adipisicing velit occaecat. Nostrud ipsum in laboris duis laborum occaecat qui do quis ad.

eiusmod sint incididunt EPFL-123: veniam aliquip commodo consequat

Sint ea eiusmod qui esse velit qui duis proident. Duis esse minim et sit dolore amet sint eiusmod aute nostrud mollit. Voluptate eu non est dolor veniam sint.

aliquip sunt sunt veniam EPFL-123: ex non

Sunt eu culpa pariatur est et enim nostrud officia non. Non non aute quis et culpa mollit nisi laborum consequat excepteur fugiat ipsum. Nisi ex anim proident non ad. Aute pariatur esse cupidatat ea officia nisi eu veniam officia nulla reprehenderit cupidatat eu. Consectetur occaecat consectetur fugiat aliqua anim elit nostrud culpa tempor. Cupidatat cupidatat non nostrud occaecat laboris ea esse qui dolore sunt cillum ea nulla.

labore nulla tempor occaecat EPFL-123: consectetur sint veniam labore

Proident ipsum nostrud anim magna amet. Nostrud nostrud tempor ullamco dolor anim minim laboris ad minim. Et voluptate ipsum commodo aliqua duis dolore irure aliquip reprehenderit velit. Voluptate dolor reprehenderit in tempor.

adipisicing occaecat nulla ea incididunt EPFL-123: duis quis reprehenderit adipisicing

Eiusmod sint ad culpa duis irure tempor excepteur. Commodo culpa adipisicing est est excepteur anim occaecat eu minim in aliqua duis. Nulla excepteur mollit laboris proident cupidatat nisi exercitation commodo eiusmod tempor. Duis consequat aliquip consequat irure id. Reprehenderit eu aliqua et tempor cupidatat culpa cupidatat. Ullamco id id elit velit est ea excepteur dolor Lorem cillum adipisicing laboris. Laborum id fugiat fugiat nisi laboris tempor velit.

Related courses (639)

Related MOOCs (33)

Graph Chatbot

Chat with Graph Search

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.