BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:Convergence of graphs: graphons and growth models - Frederik Søre
nsen (University of Oxford)
DTSTART;VALUE=DATE-TIME:20181025T120000
DTEND;VALUE=DATE-TIME:20181025T130000
UID:https://talks.ox.ac.uk/talks/id/34d7b1dc-687c-42aa-9a9d-3d50d0fa335b/
DESCRIPTION:In this talk we will discuss two different approaches to provi
ng that a sequence of (random) graphs converges to some limit object.\nFir
stly\, we will introduce a class of functions known as graphons\, which ca
n be thought of as uncountable graphs.\nWe will discuss how to define a se
nsible probabilistic notion of graph convergence\, and how to utilize the
link between graphs and graphons to translate this notion to the somewhat
"nicer" space of graphons in order to prove that a sequence of graphs conv
erges.\nSecondly\, we will point towards limitations in the above approach
and discuss how the Gromov-Hausdorff-Prokhorov metric can be a useful alt
ernative\, limiting the discussion to sequences of trees.\nIf time permits
we will end the talk by introducing some concrete examples of convergent
sequences of random graphs.\nThe talk is meant to be introductory and will
not rely on any previous knowledge of graphs or graph convergence.\nSpeak
ers:\nFrederik Sørensen (University of Oxford)
LOCATION:Mathematical Institute (S2.37)\, Woodstock Road OX2 6GG
TZID:Europe/London
URL:https://talks.ox.ac.uk/talks/id/34d7b1dc-687c-42aa-9a9d-3d50d0fa335b/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:Convergence of graphs: graphons and growth models - Frede
rik Sørensen (University of Oxford)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR