2024/03/19 by Serte Donderwinkel, Donderwinkel, Serte, Brett Kolesnik +1
Decision Sciences · Economics, Econometrics and Finance · #05C20 #11P21 #52B05 #60F05 #60G50 #62J15 #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Applications #Game Theory and Voting Systems #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2403.12940
openalex publication_date 2024/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the relationship between tournaments and random walks. This connection was first observed by Erdős and Moser. Winston and Kleitman came close to showing that Sn=Θ(4n/n5/2). Building on this, and works by Takács, these asymptotic bounds were confirmed by Kim and Pittel. In this work, we verify Moser's conjecture that Sn∼ C4n/n5/2, using limit theory for integrated random walk bridges. Moreover, we show that C can be described in terms of random walks. Combining this with a recent proof and number-theoretic description of C by the second author, we obtain an analogue of Louchard's formula, for the Laplace transform of the squared Brownian excursion/Airy area measure. Finally, we describe the scaling limit of random score sequences, in terms of the Kolmogorov excursions, studied recently by Bär, Duraj and Wachtel. Our results can also be interpreted as answering questions related to a class of random polymers, which began with influential work of Sinaĭ. From this point of view, our methods yield the precise asymptotics of a persistence probability, related to the pinning/wetting models from statistical physics, that was estimated up to constants by Aurzada, Dereich and Lifshits, as conjectured by Caravenna and Deuschel.