A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method
| dc.contributor.author | Malinovsky, Yaakov | |
| dc.date.accessioned | 2022-05-31T21:46:07Z | |
| dc.date.available | 2022-05-31T21:46:07Z | |
| dc.date.issued | 2024-07-02 | |
| dc.description.abstract | We offer an alternative proof, using the Stein-Chen method, of Bollobás' theorem concerning the distribution of the extreme degrees of a random graph. The same method also applies in a more general setting where the probability of every pair of vertices being connected by edges depends on the number of vertices. | en_US |
| dc.description.sponsorship | This research was supported by grant no 2020063 from the United States-Israel Binational Science Foundation (BSF). | en_US |
| dc.description.uri | https://link.springer.com/article/10.1007/s11009-024-10091-0 | en_US |
| dc.format.extent | 7 pages | en_US |
| dc.genre | journal articles | en_US |
| dc.identifier | doi:10.13016/m2p1wf-31kj | |
| dc.identifier.citation | Malinovsky, Yaakov. “A Note on the Distribution of the Extreme Degrees of a Random Graph via the Stein-Chen Method.” Methodology and Computing in Applied Probability 26, no. 3 (July 2, 2024): 22. https://doi.org/10.1007/s11009-024-10091-0. | |
| dc.identifier.uri | http://hdl.handle.net/11603/24771 | |
| dc.identifier.uri | https://doi.org/10.1007/s11009-024-10091-0 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Springer Nature | |
| dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
| dc.relation.ispartof | UMBC Mathematics Department Collection | |
| dc.relation.ispartof | UMBC Faculty Collection | |
| dc.rights | Attribution 4.0 International | en_US |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.title | A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method | en_US |
| dc.type | Text | en_US |
| dcterms.creator | https://orcid.org/0000-0003-2888-674X | en_US |