arXiv subjects

Oliver Krüger

Publications and source records attributed to Oliver Krüger.

6 recordsLinked to original sources

arXiv2024

Interactions Between Different Birds of Prey as a Random Point Process

The two-dimensional Coulomb gas is a one-parameter family of random point processes, depending on the inverse temperature $β$. Based on previous work, it is proposed as a simple statistical measure to quantify the intra- and interspecies repulsion among three different highly territorial birds of prey. Using data from the area of the Teutoburger Wald over 20 years, we fit the nearest and next-to-nearest neighbour spacing distributions between the respective nests of Goshawk, Eagle Owl and the previously examined Common Buzzard to $β$ of the Coulomb gas. Within each species, the repulsion measured in this way deviates significantly from the Poisson process of independent points in the plane. In contrast, the repulsion amongst each of two species is found to be considerably lower and closer to Poisson. Methodologically we investigate the influence of the terrain, of a shorter interaction range given by the two-dimensional Yukawa interaction, and the statistical independence of the time moving average we use for the yearly ensembles of occupied nests. We also check that an artificial random displacement of the original nest positions of the order of the mean level spacing quickly destroys the repulsion measured by $β> 0$. A simple, approximate analytical expression for the nearest neighbour spacing distribution derived from non-Hermitian random matrix theory proves to be very useful.

cond-mat.stat-mech↗

arXiv2020

Territorial behaviour of buzzards versus random matrix spacing distributions

A deeper understanding of the processes underlying the distribution of animals in space is crucial for both basic and applied ecology. The Common buzzard (Buteo buteo) is a highly aggressive, territorial bird of prey that interacts strongly with its intra- and interspecific competitors. We propose and use random matrix theory to quantify the strength and range of repulsion as a function of the buzzard population density, thus providing a novel approach to model density dependence. As an indicator of territorial behaviour, we perform a large-scale analysis of the distribution of buzzard nests in an area of $300$ square kilometres around the Teutoburger Wald, Germany, as gathered over a period of $20$ years. The nearest and next-to-nearest neighbour spacing distribution between nests is compared to the two-dimensional Poisson distribution, originating from uncorrelated random variables, to the complex eigenvalues of random matrices, which are strongly correlated, and to a two-dimensional Coulomb gas interpolating between these two. A one-parameter fit to a time-moving average reveals a significant increase of repulsion between neighbouring nests, as a function of the observed increase in absolute population density over the monitored period of time, thereby proving an unexpected yet simple model for density-dependent spacing of predator territories. A similar effect is obtained for next-to-nearest neighbours, albeit with weaker repulsion, indicating a short-range interaction. Our results show that random matrix theory might be useful in the context of population ecology.

q-bio.PE↗

arXiv2018

An improved method for recursively computing upper bounds for two-colour Ramsey numbers

The two-colour Ramsey number $R(m,n)$ is the least natural number $p$ such that any graph of order $p$ must contain either a clique of size $m$ or an independent set of size $n$. We exhibit a method for computing upper bounds for $R(m,n)$ recursively, using known upper bounds of $R(\cdot,\cdot)$ with lower values for at least one of the arguments. We also give an example of how this method could be used to improve several of the best known bounds that are available in the literature (which however soon will be obsolete due to a forthcoming work).

math.CO↗

arXiv2017

A computerised classification of some almost minimal triangle-free Ramsey graphs

A graph $G$ is called a $(3,j;n)$-minimal Ramsey graph if it has the least amount of edges, $e(3,j;n)$, given that $G$ is triangle-free, the independence number $α(G) < j$ and that $G$ has $n$ vertices. Triangle-free graphs $G$ with $α(G) < j$ and where $e(G) - e(3,j;n)$ is small are said to be almost minimal Ramsey graphs. We look at a construction of some almost minimal Ramsey graphs, called $H_{13}$-patterned graphs. We make computer calculations of the number of almost minimal Ramsey triangle-free graphs that are $H_{13}$-patterned. The results of these calculations indicate that many of these graphs are in fact $H_{13}$-patterned. In particular, all but one of the connected $(3,j;n)$-minimal Ramsey graphs for $j \leq 9$ are indeed $H_{13}$-patterned.

math.CO↗

arXiv2016

An invariant for minimum triangle-free graphs

We study the number of edges, $e(G)$, in triangle-free graphs with a prescribed number of vertices, $n(G)$, independence number, $α(G)$, and number of cycles of length four, $\operatorname{N}(C_4;G)$. We in particular show that $$3e(G) - 17n(G) + 35α(G) + \operatorname{N}(C_4;G) \geq 0$$ for all triangle-free graphs $G$. We also characterise the graphs that satisfy this inequality with equality.

math.CO↗

arXiv2013

Analysis of Odd/odd vertex removal games on special graphs

We analyze the Odd/odd vertex removal game introduced by P. Ottaway. We prove that every bipartite graph has Grundy value 0 or 1 only depending on the parity of the number of edges in the graph, which is a generalization of a conjecture of K. Shelton. We also answer a question originally posed by both Shelton and Ottaway about the existance of graphs for every Grundy value. We prove that this is indeed the case.

math.CO↗