An alternative version of the necessary and sufficient condition for almost sure fixation in the conditional branching process model is derived. This formulation provides an insight into why the examples considered in Buckley and Seneta (1983) all have the same condition for fixation.

We consider an M/G/1 retrial queue, where the service time distribution has a finite exponential moment. We show that the tail of the queue size distribution is asymptotically given by a geometric function multiplied by a power function. The result is obtained by investigating analytic properties of probability generating functions for the queue size and the server state.

We present a minimum counterexample to the conjecture that a negatively associated random variable has an ultra-log-concave rank sequence. The rank sequence does not in fact even need to be unimodal.