Random graphs and applications to Coxeter groups
50 mins 43 secs,
220.98 MB,
WebM
640x360,
29.97 fps,
44100 Hz,
594.89 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Behrstock, J (City University of New York)
Wednesday 11th January 2017 - 11:30 to 12:30 |
|---|
| Created: | 2017-01-27 10:30 |
|---|---|
| Collection: | Non-Positive Curvature Group Actions and Cohomology |
| Publisher: | Isaac Newton Institute |
| Copyright: | Behrstock, J |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | Erdos and Renyi introduced a model for studying random graphs of a given "density" and proved that there is a sharp threshold at which lower density random graphs are disconnected and higher density ones are connected. We will explain some new threshold theorems for random graphs and focus in particular on applications to geometric group theory: these concern divergence functions, which provide quantifications of non-positive curvature. Some of this talk will be on joint work with Hagen and Sisto; other parts are joint work with Hagen, Susse, and Falgas-Ravry. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 736.22 MB | View | Download | |
| WebM * | 640x360 | 594.89 kbits/sec | 220.98 MB | View | Download | |
| iPod Video | 480x270 | 522.2 kbits/sec | 193.91 MB | View | Download | |
| MP3 | 44100 Hz | 249.77 kbits/sec | 92.84 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||