1 paper
Alfred Kume, Fabrizio Leisen, Antonio Lijoi
Consider a list of labeled objects that are organized in a heap. At each time, object j is selected with probability pj and moved to the top of the heap. This procedure define…