Counting Connected Graphs
Event details
| Date | 10.10.2016 |
| Hour | 17:15 › 18:30 |
| Speaker | Prof. Joel Spencer, New York University |
| Location | |
| Category | Conferences - Seminars |
Let 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 between n and k. The appoaches are a virtual cornucopia of modern probabilistic techniques. These include supercritical dominant components in random graphs, local limit laws, Brownian excursions, Parkingf unctions and more.
Practical information
- General public
- Free
Organizer
- Prof. Clément Hongler