Yaakov Malinovsky

activity

20092026

most citedPrediction of Ordered Random Effects in a Simple Small Area Model

4 citations · 5 across the 19 of their papers we have counts for

collaborators

Showing math.PRShow all

13 papers · 1 filter

math.PR2026

Distinct Extreme Scores in Random Round-Robin Tournaments

Yaakov Malinovsky

We consider a general round-robin tournament model with equally strong players, where $X_{ij}$ denotes the score of player $i$ against player $j$ . We assume that $X_{ij}$ takes val…

math.PR2026

Extreme Score Distributions in Countable-Outcome Round-Robin Tournaments of Equally Strong Players

Yaakov Malinovsky

We consider a general class of round-robin tournament models of equally strong players. In these models, each of the $n$ players competes against every other player exactly once. F…

math.PR2025

Maximal Counts in the Stopped Occupancy Problem

Alexander Gnedin, Svante Janson, Yaakov Malinovsky

We revisit a version of the classic occupancy scheme, where balls are thrown until almost all boxes receive a given number of balls. Special cases are widely known as coupon-collec…

math.PR2025

A Note on a Recent Conjecture in Mathematics Magazine

Yaakov Malinovsky

In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results

math.PR2025

Hitting k primes by dice rolls

Noga Alon, Yaakov Malinovsky, Lucy Martinez +1

Let $S = (d_{1}, d_{2}, d_{3}, \dots)$ be an infinite sequence of rolls of independent fair dice. For an integer $k \geq 1$ , let $L_{k} = L_{k} (S)$ be the smallest $i$ so that there are $k$ inte…

math.PR2024

Uniqueness of Maximum Scores in Countable-Outcome Round-Robin Tournaments

Gideon Amir, Yaakov Malinovsky

In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong pl…