BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20230326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260424T062851Z
UID:1683729900@ist.ac.at
DTSTART:20230510T164500
DTEND:20230510T180000
DESCRIPTION:Speaker: Lyuben Lichev\nhosted by M. Beiglböck\, N. Berestycki
 \, L. Erdös\, J. Maas\, F. Toninelli\, E. Schertzer\nAbstract: In this ta
 lk\, we will consider one instance of the popular class of unsupervised le
 arning algorithms for finding communities in complex networks called label
  propagation algorithms. It is described as follows: we are given a networ
 k on n vertices carring labels 1\,2\,...\,n. In each round of the algorith
 m\, every vertex switches its label to the majority label in its neighborh
 ood (including its own label). At the first round\, ties are broken toward
 s smaller labels\, while at each of the next rounds\, ties are broken unif
 ormly at random.We will focus on the action of the algorithm on the Erdös
 -Rényi random graph G(n\,p). More precisely\, we will see that for all su
 fficiently large p = p(n)\, the algorithm typically terminates with a uniq
 ue label as n →∞\, and will try to understand how this label behaves a
 s a function of p. In particular\, we will see why there is a phase transi
 tion around p = n−1/3. The talk is based on a joint work with Marcos Kiw
 i\, Dieter Mitsche and Pawel Pralat.
LOCATION:Mondi 2 (I01.01.008)\, Central Building\, ISTA
ORGANIZER:birgit.oosthuizen-noczil@ist.ac.at 
SUMMARY:Lyuben Lichev: Label propagation on Erdös-Rényi random graphs
URL:https://talks-calendar.ista.ac.at/events/4156
END:VEVENT
END:VCALENDAR