BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mathilde Bouvel (LORIA)
DTSTART:20220602T141500Z
DTEND:20220602T160000Z
DTSTAMP:20260422T070058Z
UID:CJCS/69
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/69/">Li
 mits of permutations and graphs avoiding substructures</a>\nby Mathilde Bo
 uvel (LORIA) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAb
 stract\nIn this talk\, I would like to present a survey of a series of pap
 ers\, describing limits of random graphs or random permutations\, taken un
 iformly at random conditioned to avoid certain substructures. \nOur first 
 results concern families of pattern-avoiding permutations. Our approach is
  to use the co-called substitution decomposition of permutations\, thus en
 coding permutations as trees. Using analytic combinatorics\, we are then a
 ble to compute the expected densities of patterns in our permutations. Thi
 s result can be interpreted in the framework of permutons\, thus providing
  limit shape results for random pattern-avoiding permutations.\nAnalogous 
 results can be obtained for hereditary classes of graphs (defined by the a
 voidance of induced subgraphs)\, following a similar methodology. The obta
 ined results are limit shape results in the framework of graphons.\n
LOCATION:https://researchseminars.org/talk/CJCS/69/
END:VEVENT
END:VCALENDAR