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 85130
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
What are some useful invariants for distinguishing between random graph models?
It really depends on your applications/goals, and the graphs you consider.
Do you want to compare graph sequences or graphs of a fixed size?
First let's consider sequences.
The problem with propert …
- 219
1
vote
Zero-one law in binomial random graph model $G(n,p)$
I'm not an expert on that specific question, and it's certainly the most difficult regime of $\mathcal{G}(n,p)$ to understand, so I'll just show the path.
First, the question can be generalized as $p …
- 219
3
votes
Accepted
first order languages over graphs (and other discrete models)
To complement J.-E. Pin's answer, many other structures have been considered in the literature, like words [1], discrete metric spaces [2], maps [3] or simplicial complexes [4].
In [5] the relations b …
- 219