Statistical matching theory with a glimpse towards extremal regular graphs
42 mins 35 secs,
620.01 MB,
MPEG-4 Video
640x360,
29.97 fps,
44100 Hz,
1.94 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Csikvari, P (Massachusetts Institute of Technology, Eötvös Loránd University)
Monday 11th July 2016 - 10:30 to 11:15 |
|---|
| Created: | 2016-07-18 17:16 |
|---|---|
| Collection: | Theoretical Foundations for Statistical Network Analysis |
| Publisher: | Isaac Newton Institute |
| Copyright: | Csikvari, P |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | In this talk we will survey some recent development on statistical properties of matchings of very large and infinite graphs. The main goal of the talk is to describe a few applications of a new concept called matching measure. These applications include new results on the number of (perfect) matchings in large girth graphs as well as simple new proofs of certain statistical physical theorems. In particular, we will sketch a new proof of Schrijver's lower bound for the number of perfect matchings of regular bipartite graphs. We will also mention some extremal graph theoretic results about other graph parameters of regular graphs.
This talk is based on joint papers with various subsets of Miklos Abert, Peter E. Frenkel, Tamas Hubai and Gabor Kun. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 640x360 | 1.94 Mbits/sec | 620.01 MB | View | Download | |
| WebM | 640x360 | 545.62 kbits/sec | 170.24 MB | View | Download | |
| iPod Video | 480x270 | 522.15 kbits/sec | 162.86 MB | View | Download | |
| MP3 | 44100 Hz | 249.73 kbits/sec | 77.98 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||