BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Encoding the size of the connected components and number of surplu
 s edges of random graphs
DTSTART:20231107T131500Z
DTEND:20231107T141500Z
DTSTAMP:20260504T095700Z
UID:indico-event-10864@indico.math.cnrs.fr
DESCRIPTION:Speakers: Josué Corujo (LAMA - UPEC)\n\nIn this presentation\
 , we will delve into an inhomogeneous random graph process that incorporat
 es vertex sizes and edges emerging at exponential times with rates equal t
 o the product of the vertices sizes. We will show how this model serves as
  a natural extension of the classic Erdös-Rényi random graph. Then\, we 
 will explore a generalization of a graph exploration process known as the 
 simultaneous breadth-first walk (as introduced by V. Limic in 2019). We wi
 ll clarify how this extension enables us to encode essential information r
 elated to both the sizes of connected components and the number of surplus
  edges. This encoding represents a solid first step towards a new and simp
 ler understanding of the scaling limits of these processes.This talk is ba
 sed on a work in collaboration with Vlada Limic (CNRS\, Université de Str
 asbourg) contained in the preprint:- J. C.\, Vlada Limic (2023) A dynamic
 al approach to spanning and surplus edges of random graphs arXiv:2305.047
 16\n\nhttps://indico.math.cnrs.fr/event/10864/
LOCATION:UTC - GI
URL:https://indico.math.cnrs.fr/event/10864/
END:VEVENT
END:VCALENDAR