BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv4.9.12//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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20191024T160000
DTEND;TZID=UTC:20191024T170000
DTSTAMP:20191209T051010
CREATED:20191014T143029Z
LAST-MODIFIED:20191014T143418Z
UID:3088-1571932800-1571936400@www.eurandom.tue.nl
SUMMARY:Eindhoven Stochastics Seminar
DESCRIPTION:Joost Jorritsma (Eindhoven University of Technology) \nTypical weighted distance in preferential attachment models - Interpolating small and mini worlds \nInformation diffusion in networks can be modeled by first passage percolation\, which can also be seen as an SI (susceptible - infected) model. \nIn this talk I will discuss the model for two (non-spatial) preferential attachment models where the degrees follow a power law with parameter in (2\, 3): \nonce a preferential attachment graph on N vertices is created\, we equip every edge with an i.i.d. non-negative weight from distribution L. \nIn this edge-weighted graph\, we find for any weight distribution the precise asymptotic behavior of the weighted distance between two vertices picked uniformly at random from the graph. \nWe show that by tuning the weight distribution\, the growth terms can match any arbitrary function that is O(log log(N))\, while the network size N tends to infinity. \nSurprisingly\, this includes constant order for a large class of weight distributions (including e.g. exponential)\, in which case we identify the distributional limit.\n(joint work with Julia Komjathy) \n \n \n
URL:https://www.eurandom.tue.nl/event/eindhoven-stochastics-seminar-11/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
CATEGORIES:STO Seminar
END:VEVENT
END:VCALENDAR