Department of Mathematics

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. Motivated by ideas in geometric group theory we will survey connections between this field and graph theory and describe new threshold theorems for random graphs and applications to the geometry of Coxeter groups. Tea at 3:33 pm in Stevenson 1425. (Contact Person: Denis Osin)