BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Budapest
END:VTIMEZONE
BEGIN:VEVENT
UID:4tti23jk1n21p4dij8oejd7asi@google.com
CATEGORIES:{lang hu}Kombinatorika szeminárium{/lang}{lang en}Combinatorics seminar{/lang}
SUMMARY:Péter L. Erdős (Rényi Institute, Budapest): How to sample scale-free degree sequence's realizations uniformly and fast
LOCATION:Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:\nAbstract. \n\nBecause of the important roles of the Internet and social n
etworks in modern society, much attention has been paid to analyzing graphs
with real-world network properties. One of the most prominent traits of ma
ny real-world networks is that their degree distribution follows the so-cal
led power-law, usually with parameter \gamma between 2 and 3. Graphs with s
uch degree distributions are sparse but have vertices with very large degre
es.\nThere are peculiarly few available methods to sample the realizations
of exact degree distribution uniformly. One of them a newly developed exact
uniform sampler by Gao and Wormald (SODA, 2018), based on the configuratio
n model. This works when the parameter \gamma is > 2.8810. Another approach
is a newly developed version of the switch Markov chains, which suitable t
o sample power-law degree sequences with parameter \gamma >2.
DTSTAMP:20210724T213056Z
DTSTART;TZID=Europe/Budapest:20190412T103000
DTEND;TZID=Europe/Budapest:20190412T123000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR