41 citations · 167 across the 47 of their papers we have counts for
4 papers · 2 filters
On hitting times and fastest strong stationary times for skip-free and more general chains
James Allen Fill
An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downwa…
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
James Allen Fill
A well-known theorem usually attributed to Keilson states that, for an irreducible continuous-time birth-and-death chain on the nonnegative integers and any d, the passage time fro…
Analysis of the expected number of bit comparisons required by Quickselect
James Allen Fill, Take Nakama
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the number…
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
James Allen Fill, Svante Janson
For certain random variables that arise as limits of functionals of random finite trees, we obtain precise asymptotics for the logarithm of the right-hand tail. Our results are bas…