Related papers: On Round-Robin Tournaments with a Unique Maximum S…
Let $T$ be a tournament with nondecreasing score sequence $R$ and $A$ be its tournament matrix. An upset of $T$ corresponds to an entry above the main diagonal of $A$. Given a feasible score sequence $R$, Fulkerson~(1965) gave a simple…
Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…
We study the number of isolated vertices in a preferential attachment random graph introduced by Dereich and M\"orters in 2009. In this graph model vertices are added over time and newly arriving vertices connect to older ones with…
We study two-player zero-sum recursive games with a countable state space and finite action spaces at each state. When the family of $n$-stage values $\{v_n,n\geq 1\}$ is totally bounded for the uniform norm, we prove the existence of the…
We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a…
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…
Consider the following two-player game on the edges of $K_n$, the complete graph with $n$ vertices: Starting with an empty graph $G$ on the vertex set of $K_n$, in each round the first player chooses $b \in \mathbb{N}$ edges from $K_n$…
Existing match classification models in the tournament design literature have two major limitations: a contestant is considered indifferent only if uncertain future results do never affect its prize, and competitive matches are not…
Possible reasons for the uniqueness of the positive geometric law in the context of stability of random extremes are explored here culminating in a conjecture characterizing the geometric law. Our reasoning comes closer in justifying the…
We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let $c(\ell)$ be the limit of the ratio of the maximum number of cycles of length $\ell$ in an $n$-vertex tournament and the…
It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most…
The incomplete round robin sports tournament format, where each team plays the same number of games but faces only a subset of the other teams, is becoming increasingly popular in both youth and professional competitions. In contrast to…
Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…
We axiomatize the first-order theories of exponential integer parts of real-closed exponential fields in a language with $2^x$, in a language with a predicate for powers of 2, and in the basic language of ordered rings. In particular, the…
We consider a game with two players, consisting of a number of rounds, where the first player to win $n$ rounds becomes the overall winner. Who wins each individual round is governed by a certain urn having two types of balls (type 1 and…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
We characterize robust tournament design -- the prize scheme that maximizes the lowest effort in a rank-order tournament where the distribution of noise is unknown, except for an upper bound, $\bar{H}$, on its Shannon entropy. The robust…
A tournament on 8 or more vertices may be intrinsically linked as a directed graph. We begin the classification of intrinsically linked tournaments by examining their score sequences. While many distinct tournaments may have the same score…
An informal and elementary introduction to probability scoring and forecast verification and improvement, slightly extended from Significance 22:3(2025)16, which might be useful for less mathematical readers as a prologue to the classic…
In this expository note, we give a simple proof that a gambler repeating a game with positive expected value never goes broke with a positive probability. This does not immediately follow from the strong law of large numbers or other basic…