期刊论文详细信息
| Electronic Journal Of Combinatorics | |
| A Simple Branching Process Approach to the Phase Transition in $G_{n,p}$ | |
| Béla Bollobás1  | |
| 关键词: random graph; phase transition; branching process; | |
| DOI : | |
| 学科分类:离散数学和组合数学 | |
| 来源: Electronic Journal Of Combinatorics | |
PDF
|
|
【 摘 要 】
It is well known that the branching process approach to the study of the random graph $G_{n,p}$ gives a very simple way of understanding the size of the giant component when it is fairly large (of order $\Theta(n)$). Here we show that a variant of this ap
【 授权许可】
Others
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201909028551859ZK.pdf | 240KB |
PDF