Graz

In this talk we will discuss some classical and recent results on local limits of random graphs. It is well known that the limiting object of the local structure of the classical Erdos-Renyi random graph is a Galton-Watson tree. This can nicely be formalised in the language of Benjamini-Schramm or Aldous-Steele local weak convergence. Regarding local limits of sparse random planar graphs, there is a smooth transition from a Galton-Watson tree to a Skeleton tree. This talk is based on joint work with Michael Missethan.

Dimer models with boundary were introduced in joint work with King and Marsh as a natural
generalisation of dimers. We use these to derive certain infinite dimensional algebras and
consider idempotent subalgebras w.r.t. the boundary.
The dimer models can be embedded in a surface with boundary. In the disk case, the
maximal CM modules over the boundary algebra are a Frobenius category which
categorifies the cluster structure of the Grassmannian.

 

We give different criteria for transience of branching Markov chains. These conditions enable us to give a classification of branching random walks in random environment (BRWRE) on Cayley graphs in recurrence and transience. This classification is stated explicitly for BRWRE on $\Z^d.$ Furthermore, we emphasize the interplay between branching Markov chains, the spectral radius, and some generating functions.