[ABE-L] Próximo seminário (online) de probabilidade - IM-UFRJ

[Maria Eulalia Vares]

*Probability Webinar -   IM-UFRJ *



Dear colleagues,

Our next online seminar will be held on Monday, *December 14*, from *3 p.m.
to 4 p.m*. (Rio de Janeiro local time)

The GoogleMeet link for the seminars is:
https://meet.google.com/nxh-optr-wtq

Speaker:  *Giulio Iacobelli (IM-UFRJ)*

Title: *Random walk based algorithms for generating uniform spanning trees*

Abstract:  The task of efficiently generating uniform spanning trees of a
graph has received much attention. A breakthrough came with Aldous-Broder
and Wilson's algorithms, which can efficiently generate spanning trees
based on random walks. In this work, we study the transient behavior of
both algorithms. We introduce the notion of branches, which are paths
generated by the two algorithms on particular stopping times. This
interpretation is used to show a transient equivalence between the two
algorithms on complete graphs. This equivalence yields a hybrid approach to
generate uniform spanning trees of complete graphs faster than either of
the two algorithms. We also propose a two-stage framework to explore this
hybrid approach beyond complete graphs, showing its feasibility in some
examples.



All the talks are held in English.

Thanks for circulating this information.

Sincerely,
Organizers: Guilherme Ost and Maria Eulalia Vares



<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
Livre
de vírus. www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>.
<#m_4815804731058285083_DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
-------------- Próxima Parte ----------
Um anexo em HTML foi limpo...
URL: <http://lists.ime.usp.br/pipermail/abe/attachments/20201209/7b592c34/attachment.htm>