Georgia Institute of Technology College of Sciences

In the last twenty or so years, a rich theory has emerged concerning combinatorial problems on infinite graphs endowed with extra structure, such as a topology or a measure. It turns out that there is a close relationship between this theory and distributed computing, i.e., the area of computer science concerned with problems that can be solved efficiently by a decentralized network of processors. In this talk I will outline this relationship and present a number of applications.