The critical window in random digraphs.

COMBINATORICS PROBABILITY & COMPUTING(2019)

引用 3|浏览0
暂无评分
摘要
We consider the component structure of the random digraph $D(n,p)$ inside the critical window $p = n^{-1} + lambda n^{-4/3}$.We show that the largest component $mathcal{C}_1$ has size of order $n^{1/3}$ in this range. In particular we give explicit bounds on the tail probabilities of $|mathcal{C}_1|n^{-1/3}$.
更多
查看译文
关键词
Random digraph,critical window,phase transition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要