3 citations · 7 across the 4 of their papers we have counts for
5 papers
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…
The generalized Alice HH vs Bob HT problem
Svante Janson, Mihai Nica, Simon Segert
In 2024, Daniel Litt posed a simple coinflip game pitting Alice's "Heads-Heads" vs Bob's "Heads-Tails": who is more likely to win if they score 1 point per occurrence of their subs…
Better-than-average uniform random variables and Eulerian numbers, or: How many candidates should a voter approve?
Svante Janson, Warren D. Smith
Consider independent random numbers with a uniform distribution on . The number of them that exceed their mean is shown to have an Eulerian distribution, i.e., it is des…
Depth-First Search performance in a random digraph with geometric outdegree distribution
Philippe Jacquet, Svante Janson
We present an analysis of the depth-first search algorithm in a random digraph model with independent outdegrees having a geometric distribution. The results include asymptotic res…
Renewal theory in analysis of tries and strings
Svante Janson
We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variati…