English

The critical window in random digraphs

Combinatorics 2019-10-01 v2 Probability

Abstract

We consider the component structure of the random digraph D(n,p)D(n,p) inside the critical window p=n1+λn4/3p = n^{-1} + \lambda n^{-4/3}.We show that the largest component C1\mathcal{C}_1 has size of order n1/3n^{1/3} in this range. In particular we give explicit bounds on the tail probabilities of C1n1/3|\mathcal{C}_1|n^{-1/3}.

Cite

@article{arxiv.1905.00624,
  title  = {The critical window in random digraphs},
  author = {Matthew Coulson},
  journal= {arXiv preprint arXiv:1905.00624},
  year   = {2019}
}

Comments

21 pages

R2 v1 2026-06-23T08:54:57.087Z