Results 41 to 50 of about 94 (91)
Games of chance with multiple objectives
Probabilistic games, Majorization, Schur convexity, Coupon collector, 91A60, 60C05, 26D15, 26B25,
Paul Campbell
core +1 more source
On occurrence of subpattern and method of gambling teams
Pattern, Gambling teams, Waiting times, Markov chains, Martingales, Test of randomness, Primary 60C05, Primary 60G42, Secondary 60G40, Secondary 62E17,
Vladimir Pozdnyakov
core +1 more source
Beat the dealer in Holland Casino's Black Jack [PDF]
Gambling;68U20;93E05;Black Jack ...
Genugten, B.B. van der
core
On the First Entrance Time Distribution of the M/D/i Queue: A Combinatorial Approach [PDF]
AMS classifications: 60C05; 60K25; 90B06; 90B22M/D/1;delivery;first entrance times;lattice path ...
Jansen, J.B.
core
The inner site-perimeter of compositions
, 2020 Compositions of n are finite sequences of positive integers (σi)ki=1 such that σ1 + σ2 + , , , + σk = n.The σ's are called parts.
Brennan, Charlotte +2 more
core
Some bounds on the coupon collector problem with universal coupon
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaWe consider a generalization of the coupon collector problem with unequal probabilities, such that there are two additional coupons in the coupon set: one that speeds up the coupon collection process, and the one that slows it down.
Jocković Jelena, Todić Bojana
doaj +1 more source
, 2002 We introduce the generalized zero-inflated allocation scheme of placing n labeled balls into N labeled cells. We study the asymptotic behavior of the number of empty cells when (n,N) belongs to the “right ” and “left ” domain of attraction.
Ljuben Mutafchiev, Nikolai Kolev
core
Accessibility percolation on Cartesian power graphs. [PDF]
J Math Biol, 2023 Schmiegelt B, Krug J.
europepmc +1 more source
, 2004 We revisit the pills problem proposed by Knuth and McCarthy. In a bottle there are m large pills and n small pills. The large pill is equivalent to two small pills. Every day a person chooses a pill at random.
Prodinger, Helmut +1 more
core
Determinantal random subgraphs
We define two families of determinantal random spanning subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of connected components, the other by connected spanning subgraphs with fixed ...
Thierry Lévy, Adrien Kassel
core +1 more source