BEGIN:VCALENDAR VERSION:2.0 PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4// BEGIN:VEVENT UID:20250723T185210EDT-5093WRVCNN@132.216.98.100 DTSTAMP:20250723T225210Z DESCRIPTION:Informal Systems Seminar\n\nSpeaker: Valentin Féray – CNRS Tenu red Research Scientist\, Institut Elie Cartan de Lorraine (IECL)\, France \n\n \n\n\n\nAbstract: By definition\, cographs are graphs that can be obt ained starting from the one-vertex graph by iterating the following 'dupli cation' operation: choose a vertex\, duplicate it (the new vertex has the same neighbours as the original vertex)\, and possibly connect by an edge the new vertex to the original one. Cographs enjoy many equivalent charact erizations (e.g.~they are exactly the graphs avoiding the path P_4 as indu ced subgraph) and have been well-studied from an algorithmic point of view (many NP hard problem are tractable when the input is assumed to be a cog raph).\n\nIn this talk we discuss the asymptotic property of large random cographs\, in particular their limit in the sense of graphons. We will con sider three different models of random cographs: a static one (uniform dis tribution on cographs with $n$ vertices)\, a dynamic one with growing size (where duplications are applied at random starting from the one vertex gr aph) and a dynamic one with constant size (where duplications and vertex d eletions are applied at random starting from any graph with $n$ vertices). \n\nBased on joint works with F. Bassino\, M. Bouvel\, L. Gerin\, M. Maazo un\, A. Pierrot and K. Rivera-Lopez.\n\n\nBiography: Valentin Féray receiv ed his Ph.D. in Mathematics from University Paris-Est Marne-La-Vallée (adv isor : Philippe Biane). He is currently a CNRS tenured research scientist at IECL\, Nancy. Before that he was an Assistant professor of Pure Mathema tics at the University of Zurich and a CNRS tenured research scientist in LaBRI\, Bordeaux. In 2013\, he gave the Cours Peccot at College de France. \n DTSTART:20230512T160000Z DTEND:20230512T170000Z LOCATION:CA\, ZOOM SUMMARY:Graphon Limits of Static and Dynamic Models of Random Cographs URL:/cim/channels/event/graphon-limits-static-and-dyna mic-models-random-cographs-351622 END:VEVENT END:VCALENDAR