BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241126T163000
DTEND;TZID=Asia/Seoul:20241126T173000
DTSTAMP:20260417T215111
CREATED:20241018T131301Z
LAST-MODIFIED:20241018T132054Z
UID:9992-1732638600-1732642200@dimag.ibs.re.kr
SUMMARY:Eng Keat Hng\, Graphon branching processes and fractional isomorphism
DESCRIPTION:In 2005\, Bollobás\, Janson and Riordan introduced and extensively studied a general model of inhomogeneous random graphs parametrised by graphons. In particular\, they studied the emergence of a giant component in these inhomogeneous random graphs by relating them to a broad collection of inhomogeneous Galton-Watson branching processes. \nFractional isomorphism of finite graphs is an important and well-studied concept at the intersection of graph theory and combinatorial optimisation. It has many different characterizations that involve a range of very different and seemingly unrelated properties of graphs. Recently\, Grebík and Rocha developed a theory of fractional isomorphism for graphons. \nIn our work\, we characterise inhomogeneous random graphs that yield the same inhomogeneous Galton-Watson branching process (and hence have a similar component structure). \nThis is joint work with Jan Hladký and Anna Margarethe Limbach.
URL:https://dimag.ibs.re.kr/event/2024-11-26/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR