Description Usage Arguments Value Examples
The graph A is corrupted with probability p and then the corrupted graph and the original graphs are matched with initialization at the identity.
1 | local_gm_errs(A, p, seed = 0)
|
A |
adjacency |
p |
corrupting probability |
seed |
random seed |
list of diagonal of match and the proportion of errors
1 | local_gm_errs(karate[], .05)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.