Graphs and Probabilities

In course

Eiusmod et pariatur id anim duis officia aliquip proident excepteur. Adipisicing nostrud ullamco mollit sunt do tempor occaecat non in consequat tempor officia veniam aliquip. Incididunt incididunt excepteur adipisicing culpa adipisicing culpa veniam proident do fugiat. Velit minim ullamco commodo ad laborum veniam labore veniam velit sint voluptate. Aliquip dolore voluptate commodo labore laboris non ex ut ut do tempor commodo labore velit. Eu cupidatat officia commodo pariatur id aute esse fugiat ex fugiat qui non est laboris. Culpa sint ullamco pariatur nisi nulla enim voluptate non do adipisicing quis reprehenderit minim excepteur.

Description

This lecture covers the relationship between graphs and probabilities, focusing on modular and super modular probabilities, correlation properties, and the use of FKG inequality. It also discusses the adjacency matrix of graphs, the 'pseudorandomness condition', and PSD matrices.

Official source

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

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

Related lectures (41)