First cycles in random directed graph processes
A directed graph process is defined by successively letting each one of n vertices send out k edges with equal probabilities given to the \(\left( \begin{matrix} n\\ k\end{matrix} \right)\) choices. At time t, exactly t of the vertices have sent out their edges. Martingale theory is used to prove some results about the distribution of the length of the first cycle.
scientific article; zbMATH DE number 4139792