Since April 2021, the seminar was replaced by a webinar, see webpage of the webinar
Wednesday 12.2.2020 at 10:00 ICS, room 318, Andrew Newman (Technische Universität Berlin): Connectivity of random simplicial complexes
Abstract: In this talk we look at a higherdimensional generalization
of the ErdősRényi random graph model to random simplicial complexes,
namely the LinialMeshulam model. In this highdimensional setting
there will often be many nonequivalent ways to topologically
generalize common graph properties. Several of these will be surveyed
and then new work will be discussed establishing an anticollapsibility
threshold in the LinialMeshulam model as a generalization of path
connectivity of random graphs. This work is motivated by questions
about highdimensional trees. This talk will assume familiarity with
random graphs but all relevant topological notions will be defined.

Tuesday 11.2.2020 at 10:00 ICS, room 419, Viktor Bezborodov (Wrocław University of Science and Technology): Stochastic growth models: asymptotic shape and growth rate
Abstract: In this talk we discuss the asymptotic shape and the spread rate for growing stochastic particle systems. We start with the classical models and results and then proceed to discuss more recent developments. We will highlight the differences between discretespace and continuousspace models. We will also briefly discuss computer simulations. 
Friday 24.1.2020 at 10:00 ICS, room 318, Tereza Klimošová (Charles University): Decomposing graphs into paths and trees
Abstract: Bensmail, Harutyunyan, Le and Thomassé conjectured that for a fixed tree T, the edge set of any graph G of size divisible by size of T
with sufficiently high degree can be decomposed into disjoint copies of T, provided that G is sufficiently highly connected in terms of maximal degree of T.
They proved the conjecture for trees of maximal degree 2 (i.e., paths). In particular, they showed that in the case of paths, the conjecture holds for 24edgeconnected graphs. 
Friday 17.1.2020 at 10:00 at 10:00 MI, room modrá posluchárna, Balázs Gerencsér (Hungarian Academy of Sciences): Decay of mutual information for factor of iid processes on the dregular tree
Abstract: We review the concept of factor of iid processes that allows to capture the behavior of local algorithms on large networks.
We investigate how much a global decision can or cannot be made using these processes. In particular, how much independent the output values need to be at far away vertices when applied on the limit case of the dregular infinite tree. 