For more information about this meeting, contact Jan Reimann, Stephen Simpson.
|Title:||Graph limits and random graphs|
|Speaker:||Jan Reimann, Pennsylvania State University|
|When does a sequence of finite graphs converge? And what should the limit object be? With the theory of random graphs in mind, Lovász and collaborators over the past ten years have built an impressive theory of graph limits that brings together combinatorics, probability theory, and logic. The talk aims to give an overview of this theory, introducing the cut distance and graphons.|
Room Reservation Information
|Date:||04 / 23 / 2013|
|Time:||02:30pm - 03:45pm|