The rencontre problem

Abstract

Let \X1k\k=1∞, \X2k\k=1∞, ·s, \Xdk\k=1∞ be d independent sequences of Bernoulli random variables with success-parameters p1, p2, ·s, pd respectively, where d ≥ 2 is a positive integer, and 0<pj<1 for all j=1,2,·s,d. Let equation* Sj(n) = Σi=1n Xji = Xj1 + Xj2 + ·s + Xjn, n =1,2 , ·s. equation* We declare a "rencontre" at time n, or, equivalently, say that n is a "rencontre-time," if equation* S1(n) = S2(n) = ·s = Sd(n). equation* We motivate and study the distribution of the first (provided it is finite) rencontre time.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…