Speakers: Ingo van Duijn

Speakers: Irina Kostitsyna

Speakers: Michele Conforti

Speakers: Samuel Fiorini

Speakers: Tony Huynh

Today Tony will tell us about Transfinite Ford-Fulkerson on a Finite Network.

Speakers: Aurélien Ooms

Speakers: Udo Hoffmann

Speakers:

date: 2019-10-16T10:30:00.000Z title: 'Using hard-core distributions for sparse graph colouring' speakers: François Pirot duration: PT1H location: Plaine campus, NO building, 8th floor, Rotule (P.2NO8.08) geolocation: latitude: 50.82005 longitude: 4.39767 tags: Graphs Coloring Graph Coloring Sparse Graphs Writing \(\mathcal{I}(G)\) for the collection of independent sets of a given graph \(G\), a random independent set \(\mathcal{B}\) drawn according to the hard-core distribution at fugacity \(\lambda\) on \(\mathcal{I}(G)\) satisfies for every independent set \(I\in \mathcal{I}(G)\) that \(\Pr[\mathcal{B} = I] = \frac{\lambda^{|I|}}{Z_\lambda(G)}\), where \(Z_\lambda(G) = \sum_{I\in \mathcal{I}(G)} \lambda^{|I|}\) is a normalising factor, called the independence polynomial of \(G\).