Random graphs and applications to Coxeter groups
- đ¤ Speaker: Jason Behrstock (City University of New York)
- đ Date & Time: Wednesday 11 January 2017, 11:30 - 12:30
- đ Venue: Seminar Room 1, Newton Institute
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Jason Behrstock (City University of New York)
Wednesday 11 January 2017, 11:30-12:30