A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method

dc.contributor.authorMalinovsky, Yaakov
dc.date.accessioned2022-05-31T21:46:07Z
dc.date.available2022-05-31T21:46:07Z
dc.date.issued2022-04-13
dc.description.abstractWe 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.sponsorshipThis research was supported by grant no 2020063 from the United States-Israel Binational Science Foundation (BSF).en_US
dc.description.urihttps://arxiv.org/abs/2204.05881en_US
dc.format.extent5 pagesen_US
dc.genrejournal articlesen_US
dc.genrepreprintsen_US
dc.identifierdoi:10.13016/m2p1wf-31kj
dc.identifier.urihttp://hdl.handle.net/11603/24771
dc.identifier.urihttps://doi.org/10.48550/arXiv.2204.05881
dc.language.isoen_USen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Mathematics Department Collection
dc.relation.ispartofUMBC Faculty Collection
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.en_US
dc.titleA note on the distribution of the extreme degrees of a random graph via the Stein-Chen methoden_US
dc.typeTexten_US
dcterms.creatorhttps://orcid.org/0000-0003-2888-674Xen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2204.05881.pdf
Size:
133.68 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description: