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 29697
The study of probability distributions over graphs. For example, the Erdős–Rényi model where each edge occurs independently with equal probability.
1
vote
Vertex degree on random graphs
Just an amateur answer, I would assume there's a paper or known approach out there from experts.
I would partition the vertices into equal sets $U,V$ and delete edges to make it a bipartite graph. It …
- 4,529
1
vote
Accepted
Almost all simple graphs are small world networks
whether there is an elementary proof that almost all simple graphs are very small world networks
Following up on Brendan McKay's comment. The chance that an Edos-Renyi$(0.5,n)$ graph has diameter …
- 4,529
2
votes
Edge probability for connected Erdős–Rényi model
I agree strongly with Peter in the comments: if you're interested in $p \gg \frac{\log n}{n}$, then don't do any hard work, just show the answer is essentially $p$ since the graph is essentially alway …
- 4,529
11
votes
Accepted
Probability of a graph procedure
Here's one. You can think of the graph construction process as gradually building a set $S$ of vertices that have been touched so far, beginning with a random two vertices. Let $S_k$ be the set of the …
- 4,529