BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Ashoka University
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20161006T163000
DTEND;TZID=UTC:20161006T173000
DTSTAMP:20211006T223731Z
CREATED:20211006T223731Z
LAST-MODIFIED:20211006T223731Z
UID:20201-1475771400-1475775000@www.ashoka.edu.in
SUMMARY:Generating infinite graphs randomly II
DESCRIPTION:Abstract: Suppose we want to generate a graph whose vertices is the natural numbers. We would also like to do this in a random fashion. How can one do this? What could we mean by random? We will discuss classical results of Erdös-Rényi and Rado. We will discuss some various types of “randomness” arising from different models\, including one introduced by myself and Csaba Biró. \n 
URL:https://www.ashoka.edu.in/event/generating-infinite-graphs-randomly-ii/
CATEGORIES:Offline
END:VEVENT
END:VCALENDAR