[ABE-L] COLMEA -=?ISO-8859-1?Q?_Modelos_Estoc=E1sti?==?ISO-8859-1?Q?cos_e_Aplica=E7=F5es_?=- 25/10 - na PUC
Maria Eulalia Vares
eulalia em im.ufrj.br
Seg Out 16 10:35:01 -03 2017
Prezados colegas,
O COLMEA - Colóquio Interinstitucional Modelos Estocásticos e Aplicações - tem
mais um encontro no próximo dia 25, a partir das 14hs, na PUC-Rio. Nesta
ocasião teremos as palestras de Marco Molinaro (PUC-Rio) e Cristina Toninelli
(Paris 6 & Paris 7).
Programa:
14:00 h - 15:20h Marco Molinaro (PUC-Rio)
"Online and Random-order Load Balancing Simultaneously"
15:40h - 17:00h Cristina Toninelli (Paris 6 & Paris 7)
"Bootstrap percolation and kinetically constrained spin models: critical time
scales"
17:00h Discussão e lanche
Local: Sala de reuniões do Decanato do CTC
12 º andar do prédio Cardeal Leme, PUC-Rio, Gávea
Um cartaz para divulgação encontra-se aqui:
http://www.im.ufrj.br/~coloquiomea/cartaz/2017_10.pdf
Informações mais completas sobre o COLMEA podem ser encontradas aqui:
http://www.im.ufrj.br/~coloquiomea/
Todos são muito bem vindos. Agradecemos também pela divulgação em suas
instituições.
Atenciosamente,
o comitê organizador: Augusto Q. Teixeira (IMPA), Evaldo M.F. Curado
(CBPF), Freddy Hernández (UFF), Leandro P. R. Pimentel (UFRJ), Maria
Eulalia Vares (UFRJ), Simon Griffiths (PUC-Rio)
---
Resumos das palestras:
Online and Random-order Load Balancing Simultaneously
Marco Molinaro (PUC-Rio)
We consider the problem of online load balancing under $\ell_p$-norms:
sequential jobs need to be assigned to one of the machines and the goal is to
minimize the $\ell_p$-norm of the machine loads. This generalizes the
classical problem of scheduling for makespan minimization (case
$\ell_{\infty}$) and has been thoroughly studied. We provide algorithms with
simultaneously optimal guarantees for the worst-case model as well as for the
random-order (i.e. secretary) model, where an arbitrary set of jobs comes in
random order. A crucial component for this result that we will try to
highlight in the talk is a connection between smoothings of $\ell_p$ norms,
the so-called Online Linear Optimization problem, and the expected norm of
sums of random vectors.
Bootstrap percolation and kinetically constrained spin models: critical time
scales
Cristina Toninelli (Paris 6 & Paris 7)
Recent years have seen a great deal of progress in understanding the behavior
of bootstrap percolation models, a particular class of monotone cellular
automata. In the two dimensional lattice there is now a quite complete
understanding of their evolution starting from a random initial condition,
with a universality picture for their critical behavior. Much less is known
for their non-monotone stochastic counterpart, namely kinetically constrained
models (KCM). In KCM each vertex is resampled (independently) at rate one by
tossing a $p$-coin iff it can be infected in the next step by the bootstrap
model. In particular infection can also heal, hence the non-monotonicity.
Besides the connection with bootstrap percolation, KCM have an interest in
their own: when $p\to 0$ they display some of the most striking features of
the liquid/glass transition, a major and still largely open problem in
condensed matter physics. I will discuss some recent results on the
characteristic time scales of KCM as $p\to 0$ and the connection with the
critical behavior of the corresponding bootstrap models.
--
Maria Eulalia Vares
Instituto de Matemática - UFRJ
http://www.im.ufrj.br/~eulalia
#fica MCTI
Mais detalhes sobre a lista de discussão abe