# The rencontre problem

Let {X^1_k}_k=1^∞, {X^2_k}_k=1^∞, ..., {X^d_k}_k=1^∞ be d independent sequences of Bernoulli random variables with success-parameters p_1, p_2, ..., p_d respectively, where d ≥ 2 is a positive integer, and 0<p_j<1 for all j=1,2,...,d. Let S^j(n) = ∑_i=1^n X^j_i = X^j_1 + X^j_2 + ... + X^j_n, n =1,2 , .... We declare a "rencontre" at time n, or, equivalently, say that n is a "rencontre-time," if S^1(n) = S^2(n) = ... = S^d(n). We motivate and study the distribution of the first (provided it is finite) rencontre time.

• 1 publication
• 4 publications
• 3 publications
research
05/16/2022

### Order statistics from exchangeable random variables are always sufficient

Let (X_1,…,X_n) be an exchangeable random vector with distribution funct...
research
02/17/2022

### Full-Span Log-Linear Model and Fast Learning Algorithm

The full-span log-linear(FSLL) model introduced in this paper is conside...
research
12/19/2020

### The level crossings of random sums

Let {a_j}_j = 0^N and {b_j}_j = 0^N be sequences of mutually independent...
research
07/08/2018

### Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

We present a complete reasoning principle for contextual equivalence in ...
research
04/03/2019

### Error bounds for the normal approximation to the length of a Ewens partition

Let K(=K_n,θ) be a positive integer-valued random variable whose distrib...
research
07/16/2022

### A Statistical Approach to Broken Stick Problems

Let a stick be broken at random at n-1 points to form n pieces. We consi...
research
01/20/2019

### Four Deviations Suffice for Rank 1 Matrices

We prove a matrix discrepancy bound that strengthens the famous Kadison-...