[Todos] Seminario de Probabilidad y Estadística Matemática: edición especial.

[Pablo Groisman]

Seminario Seminario de Probabilidad y Estadística Matemática.


PROXIMO ENCUENTRO: Lunes 27 de Junio, 11:00hs.
EXPOSITOR: Alexandre Gaudilliere, Centre de Mathématiques et
Informatique, Université de Provence Aux Marseille l.
TITULO: Looking for large cliques through spin glasses.
LUGAR: Aula de Seminarios del Departamento de Matemática, 2do piso, Pabellón 1.


ABSTRACT: The search problem for the largest cliques in a given graph
is an NP-hard problem. Numerical simulations have proven the high
efficiency of a recent algorithm for this problem: the cavity
algorithm that was introduced by Iovanella, Scoppola and Scoppola.
This is a conservative version of a probabilistic cellular automata
built on statistical mechanics methods introduced in the study of spin
glasses. We will analyze quantitatively the algorithm efficiency for
graphs that are generally considered among the more challenging for
the largest cliques search problem: Erd\"os random graphs. We will
then have to understand the dynamics of a small cloud of particles in
a disordered environment.



______________________________________________________________________
Para ver el calendario del seminario
http://www.google.com/calendar/embed?src=987brtcpho5tt3ch2ud0oobkds%40group.calendar.google.com&ctz=America/Argentina/Buenos_Aires

Para mas información sobre el seminario
http://mate.dm.uba.ar/~drodrig/seminario/

Para recibir información sobre el seminario, suscribirse a la lista Kolmogorov
http://mate.dm.uba.ar/mailman/listinfo/kolmogorov
____________________________________________________________________