\documentclass[oneside,final,12pt]{book}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}

\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}

\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{english}
\setotherlanguage{hebrew}
%%\setmainfont[Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}

\begin{center}
\vspace*{\baselineskip}

{\Large Department of Mathematics, BGU}

\vspace*{\baselineskip}

\rule{\textwidth}{1.6pt}\vspace*{-\baselineskip}\vspace*{2pt}
\rule{\textwidth}{0.4pt}\\[\baselineskip]

{\Huge Colloquium}\\[0.2\baselineskip]

\rule{\textwidth}{0.4pt}\vspace*{-\baselineskip}\vspace{3.2pt}
\rule{\textwidth}{1.6pt}\\[\baselineskip]

\textbf{On} \emph{Sunday, December  7, 2025}
\bigskip

\textbf{At} \emph{12:00 -- 13:00}
\bigskip

\textbf{In} \emph{Math -101}

\vspace*{2\baselineskip}

{\large\scshape Yaakov Malinovsky 
  %
  (University of Maryland)
}
\bigskip

will talk about
\bigskip

{\Large\bfseries Negative Dependence in Tournaments, Distribution of Extreme Scores, and Uniqueness of the Maximum\par}
\bigskip

\end{center}
\vfill

\textsc{Abstract:}
Negative dependence among participants’ outcomes arises naturally in probabilistic models of tournaments and plays an important role in various
asymptotic results, including limit theorems, Poisson approximations, and the behavior of extremal scores. In particular, the property of negative orthant dependence has been shown in several works for different tournament models, usually requiring a separate proof in each case. In this work, we present a unified and more general approach by establishing the stronger
property of negative association. This stronger notion of dependence allows us to derive limit distributions for order statistics, such as the maximum
and the second-highest scores, even though their exact distributions are not available for general tournament sizes. We illustrate our approach using the
round-robin tournament model (paired-comparison model in statistics). We also resolve an open problem and prove that the probability of having a
unique winner tends to one as the number of players grows.





\bigskip
\begin{center}
{\bfseries Please Note the Unusual Day and Time!}
\end{center}



% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex: