13 citations · 29 across the 6 of their papers we have counts for
7 papers
Tournament limits: Degree distributions, score functions and self-converseness
Erik Thörnblad
Motivated by known results for finite tournaments, we define and study the score functions of tournament kernels and the degree distributions of tournament limits. Our main theorem…
The greedy walk on an inhomogeneous Poisson process
Katja Gabrysch, Erik Thörnblad
The greedy walk is a deterministic walk that always moves from its current position to the nearest not yet visited point. In this paper we consider the greedy walk on an inhomogene…
Eplett's theorem for self-converse generalised tournaments
Erik Thörnblad
The converse of a tournament is obtained by reversing all arcs. If a tournament is isomorphic to its converse, it is called self--converse. Eplett provided a necessary and sufficie…
Another proof of Moon's theorem on generalised tournament score sequences
Erik Thörnblad
Landau \cite{Landau1953} showed that a sequence of integers is the score sequence of some tournament if and only if for all $…
Decomposition of tournament limits
Erik Thörnblad
The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we stu…
The dominating colour of an infinite Pólya urn model
Erik Thörnblad
We study a Pólya-type urn model defined as follows. Start at time 0 with a single ball of some colour. Then, at each time n>0, choose a ball from the urn uniformly at random. With…
Asymptotic degree distribution of a duplication-deletion random graph model
Erik Thörnblad
We study a discrete-time duplication-deletion random graph model and analyse its asymptotic degree distribution. The random graphs consists of disjoint cliques. In each time step e…