[Colloq] Theory Seminar today, Apr 14, 2:50 PM, 366 WVH: Gabor Lippner on "Local algorithms on sparse graphs"

[Rajmohan Rajaraman]

Speaker: Gabor Lippner
         Department of Mathematics
         Northeastern University

Title: Local algorithms on sparse graphs

When and where: Thursday, April 14, 2:50 PM
                366 WVH

Abstract: 

A local algorithm aims to compute some global structure on a graph using only simultaneous, local, decisions at the nodes. I will review recent developments on the possibilities and the limitations of such algorithms, and explain their connection to the theory of graph limits.

Bio:

Gabor Lippner is an Assistant Professor in the Department of Mathematics at Northeastern University.  He obtained his PhD from Eotvos University, Budapest, Hungary in 2009.  He was a postdoctoral fellow at Harvard University, 2010-2014, working with Shing-Tung Yau.  He has won multiple awards including the Renyi Kato Prize of the J. Bolyai Math. Soc.  His areas of interest include discrete mathematics, with a focus on spectral graph theory and graph limits, and computational methods for higher dimensional networks.

Best,

Rajmohan.