BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20231114T165401Z
DTSTART:20231206T150000Z
DTEND:20231206T160000Z
SUMMARY:Vsevolod Shneer - First passage percolation on Erdos-Renyi graphs
  with general weights 
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}l2an-loykp8
 0h-av7gyj
DESCRIPTION:Seva Shneer (Heriot-Watt University) will speak at the Probab
 ility seminar. (in-person)\n\nWe consider an Erdos-Renyi random graph on
  n nodes where the probability of an edge being present between any two 
 nodes is equal to lambda/n with lambda > 1. Every edge is assigned a (no
 n-negative) weight independently at random from a general distribution. 
 For every path between two typical vertices\, we introduce its hop-count
  (which counts the number of edges on the path) and its total weight (wh
 ich adds up the weights of all edges on the path). We prove a limit theo
 rem for the joint distribution of the appropriately scaled hop-count and
  general weights. This theorem\, in particular\, provides a limiting res
 ult for hop-count and the total weight of the shortest path between two 
 nodes. This is a joint work with Fraser Daly and Matthias Schulte.\n
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Max Newman Room G.107\, Alan Turing Building\, Manchester
END:VEVENT
END:VCALENDAR