Erdős Péter: Every fully graphic degree sequence region is P-stable

In 1989 Jerrum and Sinclair provided an approximation algorithm to calculate 0-1 permanents. Their approach is based on a Markov chain Monte Carlo method to sample perfect matchings in bipartite graphs. They generalized their method to produce realizations of more general degree sequences. The method works if the degree sequences set under consideration satisfy the so-called P-stability. Finding P-stable sets are hard. In this lecture we will discuss a new approach to find effectively such degree sequence sets.

The zoom link is: https://zoom.us/j/2961946869?omn=92447594793