Conversation
Co-authored-by: Emanuele Natale <natema@users.noreply.github.com>
Co-authored-by: Emanuele Natale <natema@users.noreply.github.com>
Co-authored-by: Emanuele Natale <natema@users.noreply.github.com>
Co-authored-by: Emanuele Natale <natema@users.noreply.github.com>
…ssi/Graphs.jl into bernoulli_random_graphs
Codecov Report
Additional details and impacted files@@ Coverage Diff @@
## master #200 +/- ##
==========================================
- Coverage 97.28% 97.24% -0.05%
==========================================
Files 115 114 -1
Lines 6789 6610 -179
==========================================
- Hits 6605 6428 -177
+ Misses 184 182 -2 |
I have just implemented the generator described in this paper , I have no knowledge of a directed case. |
| g2_adj = adjacency_matrix(g2) | ||
| @test g1_adj == g2_adj | ||
| @test diag(g1_adj) == diag(g2_adj) == zeros(n) | ||
| ρ = 0.5 # non isomorphism case |
There was a problem hiding this comment.
can we do a probabilistic test on the correlation with ample error margins?
|
@aurorarossi is this good to go? |
|
Side note, this might be linked to #212 |
gdalle
left a comment
gdalle
left a comment
There was a problem hiding this comment.
This looks good but it still needs tests that the probability of an edge is approximately p, and that the correlation between (nondiagonal?) adjacency matrices is approximately \rho
3 participants
With this PR I add the Bernoulli random graph and the$\rho$ -correlated Bernoulli random graphs generators.