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 questions only
not deleted
user 60768
The study of probability distributions over graphs. For example, the Erdős–Rényi model where each edge occurs independently with equal probability.
3
votes
0
answers
250
views
Distribution of the k-core of a random graph
A k-core of a graph is the maximal subgraph with minimal degree k. For example, the 2-core would emerge by subsequently deleting degree-1 vertices of a graph.
I've seen a lot of work on existence of …
- 255
11
votes
1
answer
377
views
Question on a paper by Benjamini/Kozma/Wormald about a “well known fact”
In "The mixing time of the giant component of a random graph" by the aforementioned authors, in the last proof on page 19 it says something along the lines of
"It is well known and easy to verify tha …
- 255