============================================================
   Seminário de Teoria da Computaçăo e Combinatória (TCC)

============================================================

Título:      Graph limits and exchangeability

            
Palestrante: Balázs Ráth
             Institute of Mathematics
             Budapest University of Technology and 
                  Economics (BME)

Hora e Data: 10h30m, quinta-feira, 08 de julho de 2010

Local:       auditório do NUMEC

Resumo:

The theory  of limits of dense graph  sequences was initiated
by Lovász and Szegedy  in 2006: roughly speaking, a sequence
of simple  graphs converges if  the density of  every "small
testgraph"   converges.   The   limit  objects   are  called
graphons.  In 2007 Diaconis and Janson related the theory of
graph  limits to  a representation  theorem  about infinite,
exchangeable arrays by Aldous  (1981).  In this talk we give
an overview of  the related results and attempt  to show why
Szemeredi's  lemma  can   be  replaced  by  de  Finetti-type
arguments in the construction of graphons.