Search Mailing List Archives
[theory-seminar] Combinatorics seminar talk next Thursday (Oct. 11) at 3pm by Persi Diaconis (Stanford) in 384-H
ofirgeri at stanford.edu
Wed Oct 10 18:13:46 PDT 2018
There is a talk of interest tomorrow at the combinatorics seminar - see details below.
From: Jacob Fox <jacobfox at stanford.edu>
Sent: Wednesday, October 10, 2018 4:45 PM
To: Ofir Geri
Subject: Combinatorics seminar talk next Thursday (Oct. 11) at 3pm by Persi Diaconis (Stanford) in 384-H
I think the combinatorics seminar talk on Thursday by Persi Diaconis will be of interest to many in theoretical computer science. Can you advertise it on the theory seminar mailing list?
When: Thursday, October 11, 3-4pm
Speaker: Persi Diaconis (Stanford)
Title: PERMANENTAL GENERATING FUNCTIONS AND SEQUENTIAL IMPORTANCE SAMPLING
Abstract: Counting permutations with restricted positions is a classical activity (menage problem 1708). Many approaches will be reviewed (evaluating permanents,Markov chain Monte Carlo, ...). A new 'sequential importance sampling algorithm' is proposed. This seems to work well and I have been able to prove some things about it using Bregman's inequality (solution of Minc conjecture). Working it out in special cases (eg, count permutations that move i at most k places) needs delicate analysis of permanents with variables within used to keep track of things). these yield elegant generating functions. this is joint work with Fan Chung, Brett Kolasnick, Ron Graham and Andy Tsao.
The seminar webpage is:
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the theory-seminar