BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Counting Connected Graphs
DTSTART:20161010T171500
DTEND:20161010T183000
DTSTAMP:20260407T003003Z
UID:d7cb3aed48372b80a530d9a9adadd478273a5b84f78d1dd7f3bc0dcd
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Joel Spencer\,  New York University\nLet C(n\,k) be the
  number of labelled connected graphs with n vertices and n-1+k edges. For 
 k=0 (trees) we have Cayley's Formula. We examine the asymptotics of C(n\,k
 ). There are several ranges depending on the asymptotic relationship betwe
 en n and k. The appoaches are a virtual cornucopia of modern probabilistic
  techniques. These include supercritical dominant components in random gra
 phs\, local limit laws\, Brownian excursions\, Parkingf unctions and more.
LOCATION:CM01 http://plan.epfl.ch/?lang=fr&room=cm01
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR