Degrees in Random Graphs and Tournament Limits

  • Datum:
  • Plats: Polhemssalen, Ångströmlaboratoriet, Lägerhyddsvägen 1, Uppsala
  • Doktorand: Thörnblad, Erik
  • Om avhandlingen
  • Arrangör: Matematiska institutionen
  • Kontaktperson: Thörnblad, Erik
  • Disputation


This thesis consists of an introduction and six papers on the topics of degree distributions in random graphs and tournaments and their limits.

The first two papers deal with a dynamic random graph, evolving in time through duplication and deletion of vertices and edges. In Paper I we study the degree densities of this model. We show that these densities converge almost surely and determine their limiting values exactly as well as asymptotically for large degrees. In Paper II we study the evolution of the maximum degree and provide a precise growth rate thereof.

Paper III deals with a dynamic random tree model known as the vertex-splitting tree model. We show that the degree densities converge almost surely and find an infinite linear system of equations which they must satisfy. Unfortunately we are not able to show that this system has a unique solution except in special cases.

Paper IV is about self-converse generalised tournaments. A self-converse generalised tournament can be seen as a matrix whose entries take values in [0,1] and whose diagonally opposite elements sum to 1. We characterise completely the marginals of such a matrix, and show that such marginals can always be realised by a self-converse generalised tournament.

In Paper V, we define and develop the theory of tournament limits and tournament kernels. We characterise transitive and irreducible tournament limits and kernels, and prove that any tournament limit and kernel has an essentially unique decomposition into irreducible tournament limits or kernels interlaced by a transitive part.

In Paper VI, we study the degree distributions of tournament limits, or equivalently, the marginals of tournament kernels. We describe precisely which distributions on [0,1] which may appear as degree distributions of tournament limits and which functions from [0,1] to [0,1] may appear as the marginals of tournament kernels. Moreover, we show that any distribution or marginal on this form may be realised by a tournament limit or tournament kernel. We also study those distributions and marginals which can be realised by a unique tournament limit or kernel, and find that only the transitive tournament limit/kernel gives rise to a degree distribution or marginal with this property.