• Counting self-avoiding walks on the hexagonal lattice 

      [SNAP-2019-006-EN] Duminil-Copin, Hugo (Mathematisches Forschungsinstitut Oberwolfach, 2019-06-04)
      In how many ways can you go for a walk along a lattice grid in such a way that you never meet your own trail? In this snapshot, we describe some combinatorial and statistical aspects of these so-called self-avoiding ...
    • Limits of graph sequences 

      [SNAP-2019-010-EN] Klimošová, Tereza (Mathematisches Forschungsinstitut Oberwolfach, 2019-09-04)
      Graphs are simple mathematical structures used to model a wide variety of real-life objects. With the rise of computers, the size of the graphs used for these models has grown enormously. The need to efficiently represent ...
    • Random permutations 

      [SNAP-2019-007-EN] Betz, Volker (Mathematisches Forschungsinstitut Oberwolfach, 2019-07-12)
      100 people leave their hats at the door at a party and pick up a completely random hat when they leave. How likely is it that at least one of them will get back their own hat? If the hats carry name tags, how difficult ...