BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Namur Institute For Complex Systems - ECPv6.17.5//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Namur Institute For Complex Systems
X-ORIGINAL-URL:https://www.naxys.be
X-WR-CALDESC:Events for Namur Institute For Complex Systems
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Brussels
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20270328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20271031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Brussels:20261112T130000
DTEND;TZID=Europe/Brussels:20261112T140000
DTSTAMP:20260929T101008Z
CREATED:20260402T100822Z
LAST-MODIFIED:20260929T101008Z
UID:2650-1794488400-1794492000@www.naxys.be
SUMMARY:Nelly Litvak (Eindhoven University of Technology)
DESCRIPTION:Title: Local weak convergence and heavy tails of PageRank \nAbstract:  \nPageRank\, introduced by Google in 1998 to rank web pages\, is one of most common centrality measures in complex networks. In the empirical data\, whenever a network\, directed or undirected\, has a power law (in-)degree distribution\, PageRank follows the power law with the same exponent.  The so-called power law hypothesis conjectured that this observation holds for all networks with power-law (in-)degree distribution. While this conjecture is very intuitive\, the actual results turn out to be much more nuanced. In this talk I will tell about the exploration of the power law hypothesis in random graph models. An important ingredient of the recent analysis is our result that if a sequence of random graphs converges locally weakly to a rooted random graph\, then the PageRank distribution converges to that of the PageRank of the root. While the local weak convergence in itself doesn’t say anything about power laws\, it does bring us towards resolving the power law hypothesis and yields many unexpected insights such as the striking difference of PageRank properties in directed versus undirected graphs. \nThis seminar will take place in Room S08 at the Faculty of Sciences.
URL:https://www.naxys.be/event/nelly-litvak-eindhoven-university-of-technology/
CATEGORIES:NAXYS Seminar
END:VEVENT
END:VCALENDAR