BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:Critical scaling limit of the random intersection graph - Lorenzo
Federico (University of Warwick)
DTSTART;VALUE=DATE-TIME:20200203T120000Z
DTEND;VALUE=DATE-TIME:20200203T130000Z
UID:https://talks.ox.ac.uk/talks/id/fbe11fd2-9219-4266-a3c4-46bbe6c48b0e/
DESCRIPTION:In this talk\, we prove a scaling limit for the size (both in
terms of vertices and edges) of the largest components of a critical rando
m intersection graph in which each individual is assigned to each communit
y with a uniform probability p\, all independently of each other. We show
that the order of magnitude of the largest component depends significantly
on the asymptotic behaviour of the ratio between the number of individual
s and communities\, while the limit random variables to which component si
zes converge after rescaling are the same as in the Erdos-Renyi Random Gra
ph. We further discuss how this result relates to the known scaling limits
of critical inhomogeneous random graphs.\nSpeakers:\nLorenzo Federico (Un
iversity of Warwick)
LOCATION:Mathematical Institute (L4)\, Woodstock Road OX2 6GG
URL:https://talks.ox.ac.uk/talks/id/fbe11fd2-9219-4266-a3c4-46bbe6c48b0e/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:Critical scaling limit of the random intersection graph -
Lorenzo Federico (University of Warwick)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR