On the birthday problem: some generalizations and applications

@article{Rathie2003OnTB,
  title={On the birthday problem: some generalizations and applications},
  author={Pushpa Narayan Rathie and Peter Z{\"o}rnig},
  journal={International Journal of Mathematics and Mathematical Sciences},
  year={2003},
  volume={2003},
  pages={3827-3840}
}
We study the birthday problem and some possible extensions. We discuss the unimodality of the corresponding exact probability distribution and express the moments and generating functions by means of confluent hypergeometric functions U(−; −; −) which are computable using the software Mathematica. The distribution is generalized in two possible directions, one of them consists in considering a random graph with a single attracting center. Possible applications are also indicated. 
4 Citations

Figures from this paper

Iterations of quadratic polynomials over finite fields
Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard
A Drug-Induced Random Walk
TLDR
A natural way to proceed is to remove a pill from the bottle at random every day, and if it is a whole pill, break it in half, take one half, and return the other half to the bottle.
Active listening and interaction using Index of Co-Incidence and Birthday problem with Hidden Markov Models
The objective of the study is to look into a new method to build a human machine interactive system using active listening where machine becomes an active listener based on different states of
Active listening and interaction using Index of Co-Incidence and Birthday problem with Hidden Markov Models
TLDR
This paper proposes emotion recognition using the new concept of birthday problem and Index of Co-Incidence to build a human machine interactive system using active listening where machine becomes an active listener based on different states of emotions with which the machine interacts.

References

SHOWING 1-10 OF 31 REFERENCES
The birthday problem revisited
Introduction The birthday problem asks for the probability that at least two people in a group of k people will have the same birthday. The problem continues to attract interest in the classroom and
Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities
Given an arbitrary distribution on a countable set, consider the number of independent samples required until the first repeated value is seen. Exact and asymptotic formulae are derived for the
Approximations to the birthday problem with unequal occurrence probabilities and their application to the surname problem in Japan
Let X1, X2,..., Xn be iid random variables with a discrete distribution {pi}i=1m. We will discuss the coincidence probability Rn, i.e., the probability that there are members of {Xi} having the same
On a random mapping (T, Pj )
A random mapping (T, P,) of a finite set V into itself is studied. We give a new proof of the fundamental lemma of [6]. Our method leads to the derivation of several results which cannot be deduced
Probabilities for a Generalized Birthday Problem
Abstract Let 1's and M- 0's be randomly arranged in a row. Saperstein [11] defines the random variable k* m to be the maximum number of 1's within any m consecutive positions in the arrangement, and
A Generalized Birthday Problem
  • F. Mathis
  • Mathematics, Computer Science
    SIAM Rev.
  • 1991
A generalized version of the birthday problem is as follows. Suppose each member of a population independently receives a number randomly selected from $\{ {1,2,3, \cdots ,x} \}$, and a random sample
Extensions of the birthday surprise
Abstract The so-called “birthday surprise” is the fact that, on the average, one need only stop about 24 people at random to discover two who have the same birthday. Here we determine,
On Birthday, Collectors', Occupancy and Other Classical Urn Problems
Summary An urn contains r different balls. Balls are drawn with replacement until any k balls have been obtained at least m times each. How many draws are necessary? How many balls have been drawn
Epidemic processes on digraphs of random mappings
A random mapping ( T n ; q ) of a finite set V , V = {1,2,…, n }, into itself assigns independently to each i ∊ V its unique image j ∊ V with probability q if i = j and with probability P = (1- q )/(
Random Mapping Statistics
TLDR
A general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out is introduced, and an open problem of Knuth is solved, namely that of finding the expected diameter of a random mapping.
...
1
2
3
4
...