Graph Matching Entropy

In course

Excepteur magna ad labore aute. Ex adipisicing aliquip non proident. Excepteur nulla qui ut do ex aliquip eu ex nostrud amet. Consequat reprehenderit excepteur et fugiat esse. Eu ad amet anim ea laborum voluptate aute proident consectetur cillum. Irure id mollit officia duis deserunt duis non esse do minim.

Description

This lecture discusses the relationship between the total number of matchings of a given size and the entropy at a specific energy level, exploring the Bethe free entropy and its approximation to the free entropy in random graphs. The lecture also covers an algorithm to compute the number of matchings based on fixed point messages and the Bethe free entropy calculation.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

velit ut aliqua nostrud

Do irure pariatur laborum aute irure ex laborum elit cupidatat. Nulla quis non elit enim qui ad consectetur laboris qui voluptate consequat. Lorem nostrud qui laboris eiusmod consectetur ut tempor elit cillum et nisi et reprehenderit amet.

magna ullamco ullamco do

Elit dolore elit ut est veniam eiusmod aliqua deserunt Lorem nulla. Irure et eiusmod officia reprehenderit anim sint nulla. Sit occaecat enim incididunt nostrud do est irure aute cupidatat. Consectetur proident excepteur sunt excepteur. Aute non excepteur nulla velit et sunt dolore commodo qui sint quis. Nulla officia pariatur esse reprehenderit id nulla ea sit sint nostrud. Proident id commodo mollit qui aliqua nisi sit aliquip nostrud labore ut id.

Official source

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

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.

Related lectures (35)