Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with random-graphs
Search options not deleted
user 34435
The study of probability distributions over graphs. For example, the Erdős–Rényi model where each edge occurs independently with equal probability.
2
votes
Random graphs require O(n log(n)) edges until they are almost certainly fully connected - wh...
according to the double exponential theorem of Erdos and Renyi, I would say that you need to add $(n \ln n)/2 + n Z_n /2$ edges in which $Z_n$ is a random variable that converges in distribution to th …
- 456