Timeline for Expected number of edges in the neighborhood of vertices in random graphs
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24 at 18:31 | comment | added | Emil Jeřábek | In $G(n,M)$, I get $\frac{M(M-1)(M-2)}{\binom n2\left(\binom n2-1\right)\left(\binom n2-2\right)}\binom{n-1}2$. | |
| Jan 24 at 18:25 | comment | added | Emil Jeřábek | Well, in $G(n,p)$, any such edge is included with probability $p^3$, hence the expected number is $p^3\binom{n-1}2$. Or am I missing something? | |
| Jan 24 at 17:59 | history | asked | Manfred Weis | CC BY-SA 4.0 |