BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv5.1.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Eurandom
X-ORIGINAL-URL:https://www.eurandom.tue.nl
X-WR-CALDESC:Events for Eurandom
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20180827T110000
DTEND;TZID=UTC:20180827T120000
DTSTAMP:20200803T235841
CREATED:20180816T114424Z
LAST-MODIFIED:20190925T095512Z
UID:2162-1535367600-1535371200@www.eurandom.tue.nl
SUMMARY:Eindhoven Stochastics Seminar
DESCRIPTION:Lutz Warnke (Georgia Institute of Technology) \nA dynamic view on the probabilistic method: random graph processes\nRandom graphs are the basic mathematical models for large-scale disordered networks in many different fields (e.g.\, physics\, biology\, sociology). Since many real world networks evolve over time\, it is natural to study various random graph processes which arise by adding edges (or vertices) step-by-step in some random way. The analysis of such random processes typically brings together tools and techniques from seemingly different areas (combinatorial enumeration\, differential equations\, discrete martingales\, branching processes\, etc)\, with connections to the analysis of randomized algorithms. Furthermore\, such processes provide a systematic way to construct graphs with "surprising" properties\, leading to some of the best known bounds in extremal combinatorics (Ramsey and Turan Theory). In this talk I shall survey several random graph processes of interest (in the context of the probabilistic method)\, and give a glimpse of their analysis. \n \n \n
URL:https://www.eurandom.tue.nl/event/eindhoven-stochastics-seminar-2/
LOCATION:MF 13 (5th floor\, MetaForum Building\, TU/e)
CATEGORIES:STO Seminar
END:VEVENT
END:VCALENDAR