We present a general theorem that can be used to identify the limiting distribution for a class of combinatorial schemata. For example, many parameters in random mappings can be covered in this way. In particular, we can derive the limiting distribution of those points with a given number of total predecessors.
No takes yet. Share an insight, caveat, or question.
Drmota et al. (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: