Skip to main content

Timeline for Vertex degree on random graphs

Current License: CC BY-SA 4.0

14 events
when toggle format what by license comment
Dec 14, 2022 at 5:07 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Nov 15, 2022 at 15:47 comment added Nir Kfir I tried to do it and got confused.. I would like instructions on how to use the second moment here ?
Nov 14, 2022 at 13:50 comment added Brendan McKay The distribution of one degree is binomial, which in this case is very close to a Poisson distribution with mean $d$. Moreover, the degrees of two vertices are almost independent. The second moment method will give you what you want. This sort of thing is well worked out, probably it is a special case of something in Chapter 3 of Bollobás' book "Random Graphs".
Nov 14, 2022 at 4:38 history edited LSpice CC BY-SA 4.0
Capitalised title, deleted editorialising
Nov 14, 2022 at 4:28 answer added usul timeline score: 1
Nov 14, 2022 at 3:32 comment added usul It would help motivate to say where the question comes from, and why the large amount of existing research on Erdos-Renyi graphs did not give you an answer.
Nov 13, 2022 at 23:35 comment added Andreas Blass Can you use the central limit theorem to estimate the probability that a particular vertex has degree at least $(\log n)^{½}$?
Nov 13, 2022 at 21:24 history edited GH from MO
edited tags
Nov 13, 2022 at 20:47 history edited Joe Silverman CC BY-SA 4.0
Improved formatting, also included a missing x in the final bound for S(x)
Nov 13, 2022 at 20:13 history edited Nir Kfir
edited tags
Nov 13, 2022 at 20:12 history edited Nir Kfir CC BY-SA 4.0
added 112 characters in body
Nov 13, 2022 at 19:37 review Close votes
Nov 20, 2022 at 3:03
S Nov 13, 2022 at 19:11 review First questions
Nov 13, 2022 at 19:21
S Nov 13, 2022 at 19:11 history asked Nir Kfir CC BY-SA 4.0