![]() |
Universität Augsburg
|
![]() |
Dr. Bas Lodewijks
Sheffield
spricht am
Mittwoch, 1. Juli 2026
um
10:30 Uhr
im
Raum 2004 (L1)
über das Thema:
| Abstract: |
| We investigate a model of randomly growing trees, where new vertices arrive one-by-one and attach themselves to a vertex already in the tree selected at random. For a given function $f: \mathbb N_0\to \mathbb R_+$, the probability to attach to a vertex $v$ in the tree is proportional to $f(\text{depth of }v)$, where the depth of a vertex equals the graph distance of the vertex to the root. We are interested in structural properties of the tree for different classes of functions $f$, in particular the depth of the tree (the maximal depth among all vertices in the tree). In this talk, we will discuss two classes of functions for which the depth of the tree grows at a logarithmic and linear rate in the number of vertices. |
| Hierzu ergeht herzliche Einladung. |
| Prof. Dr. Markus Heydenreich |