Princeton University Mathematics Department Special Colloquium | |

Topic: | On sparse block models |

Speaker: | Elchanan Mossel |

Affiliation: | University of California, Berkeley |

Date: | Thursday, November 7 |

Time/Room: | 3:00pm - 4:00pm/Fine 314, Princeton University |

Block models are random graph models which have been extensively studied in statistics and theoretical computer science as models of communities and clustering. A conjecture from statistical physics by Decelle et. al predicts an exact formula for the location of the phase transition for statistical detection for this model. I will discuss recent progress towards a proof of the conjecture. Along the way, I will outline some of the mathematics relating a popular inference algorithm named belief propagation, the zeta functions of random graphs and Gibbs measure on trees. Based on joint works with Joe Neeman and Allan Sly.