BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//POPNET - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.popnet.io
X-WR-CALDESC:Events for POPNET
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Amsterdam:20221027T110000
DTEND;TZID=Europe/Amsterdam:20221027T120000
DTSTAMP:20260503T230158
CREATED:20221013T092705Z
LAST-MODIFIED:20221026T141059Z
UID:948-1666868400-1666872000@www.popnet.io
SUMMARY:POPNET Connects with Vincent Traag
DESCRIPTION:Please register for the seminar via the button. You will receive a confirmation via email.  \n\n\n\n\nRegister to attend online\n\n\n\n\n \n\n\n\n\nRegister to attend on-site\n\n\n\n\nLocation: Leiden UniverisityLeiden Institute of Advanced Computer Science (LIACS)\, Room 403Niels Bohrweg 12333 CA Leiden \n\n\n\nLarge network community detection by fast label propagation\n\n\n\nMany networks exhibit some community structure. There exists a wide variety of approaches to detect communities in networks\, each offering different interpretations and associated algorithms. For large networks\, there is the additional requirement of speed. In this context\, the so-called label propagation algorithm (LPA) was proposed\, which runs in near linear time. In partitions uncovered by LPA\, each node is ensured to have most links to its assigned community. We here propose a fast variant of LPA (FLPA) that is based on processing a queue of nodes whose neighbourhood recently changed. We test FLPA exhaustively on benchmark networks and empirical networks\, finding that it runs up to 700 times faster than LPA. In partitions found by FLPA\, we prove that each node is again guaranteed to have most links to its assigned community. Our results show that FLPA is generally preferable to LPA. \n\n\n\nAbout Vincent Traag\n\n\n\n\n\n\n\nVincent Traag is a senior researcher at the Centre for Science and Technology Studies (CWTS) of Leiden University in the Netherlands. He leads the research line on modelling the research system within the Quantitative Science Studies (QSS) research group. His main interests are mathematical models in the social sciences with a focus on (social) networks. In addition to his scientific research\, Traag also acts as a bibliometric consultant at the CWTS. \n\n\n\nTraag obtained his Master in sociology (cum laude) from the University of Amsterdam (2008). Coming from a computer science background\, and taking up mathematics during his studies in sociology\, he went on to obtain a PhD in applied mathematics in Louvain-la-Neuve\, Belgium (2013). During his PhD he studied methods for detecting communities in complex networks\, resulting in a Python software package. In addition\, he applied this methodology in several fields across the (social) sciences\, ranging from citation networks to international relations. He joined the CWTS in 2015.
URL:https://www.popnet.io/events/popnet-connects-with-vincent-traag/
CATEGORIES:Seminar
ATTACH;FMTTYPE=image/png:https://www.popnet.io/wp-content/uploads/2022/10/POPNET-Connects-with-Vincent-Traag.png
END:VEVENT
END:VCALENDAR