BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SFB TRR 352 - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:SFB TRR 352
X-ORIGINAL-URL:https://www.trr352.de
X-WR-CALDESC:Events for SFB TRR 352
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Berlin
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/Berlin:20260710T000000
DTEND;TZID=Europe/Berlin:20260710T235959
DTSTAMP:20260916T212633
CREATED:20260626T074059Z
LAST-MODIFIED:20260626T074117Z
UID:10000154-1783641600-1783727999@www.trr352.de
SUMMARY:Probability Colloquium Augsburg-Munich
DESCRIPTION:Speakers:  \n  \n\n Maria Deijfen\n Remco van der Hofstad\n\n  \nSchedule: \n  \n14:30    Welcome\n15:00    Talk Maria Deijfen\n16:00    Refreshment break\n16:30    Talk Remco van der Hofstad\n18:30    Option for common dinner\n\n  \n\n\nTitles and abstracts:\n  \nMia Deijfen: Into space – and back again! \nAbstract: The configuration model is a standard model for generating a random graph with a prescribed degree distribution. I will describe attempts to analyze a spatial version of the model\, and ongoing work to revert the spatial model to the non-spatial setting. \n  \nRemco van der Hofstad: The number and structure of connected graphs with a fixed degree sequence \nWe study connected graphs with a fixed degree sequence\, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model\, we identify the number of such connected graphs up to a subexponential order. We do this by viewing a connected graph with a given degree distribution as the realization of the giant component in a larger configuration model\, and carefully choosing the degree distribution of the larger graph so that it is likely that its giant component has the required degree distribution. To ensure that the connected graph has exactly the correct degrees\, we use a switching argument. We further identify the local structure of a uniform random graph with prescribed degrees. This is joint work with Sasha Bell and Serte Donderwinkel.
URL:https://www.trr352.de/event/probability-colloquium-augsburg-munich/
LOCATION:University of Augsburg\, Room 2004 (L1)\, Universitätsstraße 14\, Augsburg\, 86159
CATEGORIES:Colloquia
END:VEVENT
END:VCALENDAR