Lecture

Graph Construction: Martingales & Polynomials

In course

Pariatur qui sit nostrud occaecat Lorem incididunt tempor nisi do ipsum ea qui ex. Incididunt magna sit enim laboris cillum tempor voluptate. Voluptate qui tempor aute do. Aliqua aute est culpa duis aliqua dolor labore est deserunt laboris magna veniam proident adipisicing. Aute dolor cupidatat adipisicing nulla esse cillum magna ad qui cupidatat id in aliqua. Excepteur reprehenderit ex ad sunt magna eiusmod fugiat enim fugiat incididunt sint tempor ea.

Description

This lecture delves into the construction of graphs by adding multiple edges in sequence, focusing on the concept of martingales. The instructor explains the process of forming a Doob martingale and its application in constructing polynomials. By exploring the relationship between polynomials and eigenvalues, the lecture demonstrates how martingales can be used to find extreme polynomials and solve eigenvalue problems with low probability possibilities.

Official source

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

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

Analysis: Numerical analysis

Related lectures (38)

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.