Cite
HARVARD Citation
Anastos, M. et al. (2022). A scaling limit for the length of the longest cycle in a sparse random digraph. Random structures & algorithms. 60 (1), pp. 3-24. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Anastos, M. et al. (2022). A scaling limit for the length of the longest cycle in a sparse random digraph. Random structures & algorithms. 60 (1), pp. 3-24. [Online].