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 answers only
not deleted
user 3106
The study of probability distributions over graphs. For example, the Erdős–Rényi model where each edge occurs independently with equal probability.
5
votes
What are some useful invariants for distinguishing between random graph models?
Any property for which there is an efficient property testing algorithm is a candidate, because such algorithms are extremely efficient.
Another approach is to note that many random graph models have …
- 82.6k
11
votes
A Modern Proof of Erdos and Renyi's 1959 Random Graph Paper?
One reference is Chapter 5 of Random Graphs by Janson, Łuczak, and Ruciński. Their proof uses the theory of Galton–Watson branching processes, so it is not quite the same argument that Erdős a …
- 82.6k