更改

.[https://en.wikipedia.org/wiki/ArXiv arxiv]:[https://arxiv.org/abs/cond-mat/0212469 cond-mat/0212469]

.[https://en.wikipedia.org/wiki/ArXiv arxiv]:[https://arxiv.org/abs/cond-mat/0212469 cond-mat/0212469]

.[https://en.wikipedia.org/wiki/Bibcode bibcode]:[http://adsabs.harvard.edu/abs/2003PhRvE..67d6107R 2003PhRvE..67d6107R] }}</ref>

.[https://en.wikipedia.org/wiki/Bibcode bibcode]:[http://adsabs.harvard.edu/abs/2003PhRvE..67d6107R 2003PhRvE..67d6107R] }}</ref>

==与渗流的关系==

==与渗流的关系==

</ref>

</ref>

:<math> P_\infty= p'[1-\exp(-\langle k \rangle P_\infty)]. \, </math>

:<math> P_\infty= p'[1-\exp(-\langle k \rangle P_\infty)]. \, </math>

==说明==

==说明==

.[https://en.wikipedia.org/wiki/ArXiv arxiv]:[https://arxiv.org/abs/0907.1182 0907.1182]

.[https://en.wikipedia.org/wiki/ArXiv arxiv]:[https://arxiv.org/abs/0907.1182 0907.1182]

.[https://en.wikipedia.org/wiki/Bibcode bibcode]:[http://adsabs.harvard.edu/abs/2010Natur.464.1025B 2010Natur.464.1025B] }}</ref>

.[https://en.wikipedia.org/wiki/Bibcode bibcode]:[http://adsabs.harvard.edu/abs/2010Natur.464.1025B 2010Natur.464.1025B] }}</ref>

==历史==

==历史==

1959年，Edgar Gilbert在研究之前提到的连通性临界值的论文中，首次引入了G(n, p)模型。<ref name="g59">{{cite journal |last= [https://en.wikipedia.org/wiki/Edgar_Gilbert E.N. Gilbert]|year=1959 |title=Random Graphs |journal=Annals of Mathematical Statistics |volume= 30|issue= 4|pages=1141–1144 |id= |url= |accessdate= |quote=

1959年，Edgar Gilbert在研究之前提到的连通性临界值的论文中，首次引入了<math>G(n,p)</math>模型。<ref name="g59">{{cite journal |last= [https://en.wikipedia.org/wiki/Edgar_Gilbert E.N. Gilbert]|year=1959 |title=Random Graphs |journal=Annals of Mathematical Statistics |volume= 30|issue= 4|pages=1141–1144 |id= |url= |accessdate= |quote=

.[https://en.wikipedia.org/wiki/Digital_object_identifier doi]:[https://doi.org/10.1214/aoms/1177706098 10.1214/aoms/1177706098] }}</ref>G(n, M)模型则是Erdős和Rényi在他们1959年的论文中提出来的。与Gilbert一样，他们首先研究的是G(n, M)的连通性，1960年，他们做了更详细的分析。

.[https://en.wikipedia.org/wiki/Digital_object_identifier doi]:[https://doi.org/10.1214/aoms/1177706098 10.1214/aoms/1177706098] }}</ref><math>G(n,M)</math>模型则是Erdős和Rényi在他们1959年的论文中提出来的。与Gilbert一样，他们首先研究的是G(n, M)的连通性，1960年，他们做了更详细的分析。

 

==另请参阅==

==另请参阅==

*[[WS小世界模型]]

*[[WS小世界模型]]

*[[BA网络模型]]

*[[BA网络模型]]

==参考文献==

==参考文献==

<references />

<references />

==进一步阅读==

==进一步阅读==