The average number of times a stack exceeds a certain size
Kostas Manes, Ioannis Tasoulas · 2014
We obtain an explicit as well as an asymptotic formula for the average number of times a stack exceeds a fixed size j, after the execution of n push operations. The stack is assumed to have limitless capacity and all possible sequences of push and pop operations are considered to be equally likely.