activity
20002023
most citedAnalysis of some exactly solvable diminishing urn models

21 citations · 76 across the 24 of their papers we have counts for

collaborators

25 papers

math.CO2023

On Card guessing games: limit law for no feedback one-time riffle shuffle

Markus Kuba, Alois Panholzer

We consider the following card guessing game with no feedback. An ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to ma…

math.CO2023

On Card guessing games: limit law for one-time riffle shuffle

Markus Kuba, Alois Panholzer

We consider a card guessing game with complete feedback. A ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize…

math.CO2023★ 1 cited

On Card guessing with two types of cards

Markus Kuba, Alois Panholzer

We consider a card guessing strategy for a stack of cards with two different types of cards, say cards of type red (heart or diamond) and cards of type black (clubs or…

math.PR2023★ 1 cited

A note on the limit law of one-sided tree destruction

Markus Kuba, Alois Panholzer

This short note serves an addendum to the article "Destruction of very simple trees" by Fill, Kapur and Panholzer (2004). Therein, the limit law of one-sided tree destruction with…

math.PR2023

The Uncover Process for Random Labeled Trees

Benjamin Hackl, Alois Panholzer, Stephan Wagner

We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with vertices is generated uniformly at random. The…

math.CO2022★ 21 cited

Analysis of some exactly solvable diminishing urn models

Hsien-Kuei Hwang, Markus Kuba, Alois Panholzer

We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, namely, balls of a specified color, say are completely drawn after a finite…