Results 51 to 60 of about 1,308 (81)
Some bounds on the coupon collector problem with universal coupon
We 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
Accessibility percolation on Cartesian power graphs. [PDF]
Schmiegelt B, Krug J.
europepmc +1 more source
Rank three matroids are Rayleigh
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.Comment: 11 pages, 3 figures, 3
Wagner, David G.
core +2 more sources
The perimeter of uniform and geometric words: a probabilistic analysis
Let a word be a sequence of $n$ i.i.d. integer random variables. The perimeter $P$ of the word is the number of edges of the word, seen as a polyomino. In this paper, we present a probabilistic approach to the computation of the moments of $P$.
Louchard, Guy
core
Solving the migration-recombination equation from a genealogical point of view. [PDF]
Alberti F +3 more
europepmc +1 more source
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then A(S) is the sum of B(T) over all subsets T of S if and only if B(S) is the sum of (-1)^|S-T| A(T) over all subsets T of S. If we replace B(S) with (-
An Bk, Ira M. Gessel
core +2 more sources
Staircase patterns in words: subsequences, subwords, and separation number. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Limit theorem for the Robin Hood game. [PDF]
Angel O, Matzavinos A, Roitershtein A.
europepmc +1 more source

