Essential spanning forests on periodic planar graphs
Duration: 54 mins 16 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Kenyon, R (Brown University)
Monday 15 June 2015, 15:30-16:30 |
|---|
| Created: | 2015-06-29 14:44 |
|---|---|
| Collection: | Random Geometry |
| Publisher: | Isaac Newton Institute |
| Copyright: | Kenyon, R |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | The laplacian on a periodic planar graph has a rich algebraic and integrable structure, which we usually don't see when we do standard potential theory. We discuss the combinatorial, algebraic and integrable features of the laplacian, and in particular interpret combinatorially the points of the "spectral curve" of the laplacian in terms of probability measures on spanning trees and forests. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 790.26 MB | View | Download | |
| WebM | 640x360 | 597.22 kbits/sec | 237.44 MB | View | Download | |
| iPod Video | 480x270 | 521.09 kbits/sec | 207.12 MB | View | Download | |
| MP3 | 44100 Hz | 249.8 kbits/sec | 99.38 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||