Suppose I have a list of $N$ elements $\{e_1,e_2,\cdots, e_N\}$. Some elements may be non-unique and so this list has $N^\star\leq N$ unique elements. My question is:
Is there a way to construct an estimator of the fraction of unique elements $f\equiv N^\star/N$ if you are allowed to draw $M$ samples uniformly at random from the list ?
For practical purposes, I'm interested in the limit where $M \ll N$, and where $N$ can be "very large".
Just to clarify the setting in a small example, consider the list of integers $[1,2,3,3,4,5,5,6,1,2]$. For this list $N=10$ and $N^\star=6$.
I am also trying to refine this question and any comment, suggestion or reference is most welcomed.
To make things perhaps more simple, one can assume that each unique element in the list has the same number of duplicates (if any).