skip to content
 

Random graphs and applications to Coxeter groups

Presented by: 
Jason Behrstock City University of New York
Date: 
Wednesday 11th January 2017 - 11:30 to 12:30
Venue: 
INI Seminar Room 1
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.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons