BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260415T095338EDT-7266mEzZcX@132.216.98.100
DTSTAMP:20260415T135338Z
DESCRIPTION:Title: Properties of generalized hooking networks\n\n\n	Abstract
 : Hooking networks are random networks grown from a set of graphs called b
 locks\, each block with a labelled vertex called a hook. At each step in t
 he growth of the network\, a vertex called a latch is chosen from the hook
 ing network and a block is chosen from the set of blocks. A copy of the ch
 osen block is then attached to the network by fusing together its hook wit
 h the chosen latch. Hooking networks generalize several types of random tr
 ees\, which can be thought of as hooking networks grown from a single edge
  as the only block.\n	\n	\n	In this talk I will present results for certain p
 roperties of hooking networks. This includes a normal limit law for the de
 gree distributions of hooking networks. In some cases more can be proven\,
  including convergence of moments of the degree distributions\, and centra
 l limit theorems for the depth of the n'th latch chosen and the depth of a
  vertex chosen uniformly at random from the network.\n	\n	\n	This is joint wo
 rk with Cecilia Holmgren and Hosam Mahmoud.\n\n \n
DTSTART:20200108T200000Z
DTEND:20200108T210000Z
LOCATION:Room 1205\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Colin Desmarais (Uppsala)
URL:https://www.mcgill.ca/mathstat/channels/event/colin-desmarais-uppsala-3
 03838
END:VEVENT
END:VCALENDAR