<div dir="ltr"><br><div class="gmail_quote"><br><div dir="ltr"><div><br></div><div>
<p class="MsoNormal" style="line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><b><span style="font-size:12pt;line-height:115%" lang="EN-US">Probability Webinar -<span> </span>IM-UFRJ <span></span></span></b></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US"><span> </span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Dear colleagues,<span>
</span><span></span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Our next online seminar will be held on Monday, <b>December 14</b>, from <b>3 p.m. to 4 p.m</b>.
(Rio de Janeiro local time)<span></span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">The GoogleMeet link for the seminars is: </span><a href="https://meet.google.com/nxh-optr-wtq" style="color:blue;text-decoration:underline" target="_blank"><span style="font-size:12pt;line-height:115%" lang="EN-US">https://meet.google.com/nxh-optr-wtq</span></a><span style="font-size:12pt;line-height:115%" lang="EN-US">
<br>
<br>
<span></span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Speaker: <span> </span><b>Giulio
Iacobelli (IM-UFRJ)</b><span></span></span></p>
<table cellpadding="0" border="0">
<tbody><tr>
<td style="padding:0cm"><br></td>
</tr>
</tbody></table>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Title:</span><span style="font-size:12pt;line-height:115%" lang="EN-US"> </span><b><span style="font-size:12pt;line-height:115%" lang="EN-US">Random
walk based algorithms for generating uniform spanning trees</span></b><span style="font-size:12pt;line-height:115%" lang="EN-US"><span></span></span></p>
<p class="MsoNormal" style="line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Abstract:<b> </b></span><span style="font-size:12pt;line-height:115%" lang="EN-US"> 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.<span></span></span></p>
<p class="MsoNormal" style="line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US"><span> </span></span></p>
<p class="MsoNormal" style="line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">All the talks
are held in English. <span></span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Thanks for circulating this information. <span></span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:12pt;line-height:115%" lang="EN-US">Sincerely, <br>
Organizers: Guilherme Ost and Maria Eulalia Vares<span></span></span></p>
<p class="MsoNormal" style="margin:0cm 0cm 10pt;line-height:115%;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:14pt;line-height:115%" lang="EN-US"><span> </span></span></p>
</div></div><div id="m_4815804731058285083DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2"><br> <table style="border-top:1px solid #d3d4de">
<tbody><tr>
<td style="width:55px;padding-top:18px"><a href="https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail" target="_blank"><img src="https://ipmcdn.avast.com/images/icons/icon-envelope-tick-round-orange-animated-no-repeat-v1.gif" alt="" style="width:46px;height:29px" width="46" height="29"></a></td>
<td style="width:470px;padding-top:17px;color:#41424e;font-size:13px;font-family:Arial,Helvetica,sans-serif;line-height:18px">Livre de vírus. <a href="https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail" style="color:#4453ea" target="_blank">www.avast.com</a>. </td>
</tr>
</tbody></table>
<a href="#m_4815804731058285083_DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2" width="1" height="1"></a></div>
</div></div>