BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Agnes Backhausz (Budapest) DTSTART:20210430T130000Z DTEND:20210430T140000Z DTSTAMP:20260423T020954Z UID:WCS/24 DESCRIPTION:Title: Typ icality and entropy of processes on infinite trees\nby Agnes Backhausz (Budapest) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nWhen w e study random $d$-regular graphs from the point of view of graph limit th eory\, the notion of typical processes arise naturally. These are certain invariant families of random variables indexed by the infinite regular tre e. Since this tree is the local limit of random $d$-regular graphs when $d $ is fixed and the number of vertices tends to infinity\, we can consider the processes that can be approximated with colorings (labelings) of rando m $d$-regular graphs. These are the so-called typical processes\, whose pr operties contain useful information about the structure of finite random r egular graphs. In earlier works\, various necessary conditions have been g iven for a process to be typical\, by using correlation decay or entropy i nequalities. In the work presented in the talk\, we go in the other direct ion and provide sufficient entropy conditions in the special case of edge Markov processes. This condition can be extended to unimodular Galton--Wat son random trees as well. Joint work with Charles Bordenave and Balázs Sz egedy (https://arxiv.org/abs/2102.02653).\n LOCATION:https://researchseminars.org/talk/WCS/24/ END:VEVENT END:VCALENDAR