kshuffle_mean_sd: Statistics for errors induced by shuffling
In dpmcsuss/gmmle:
Description
Usage
Arguments
Value
Examples
Description
Calculate edge disagreements and probability bounds
after k vertices are randomly shuffled in a graph G
Usage
1
kshuffle_mean_sd(k, G, m = 1000)
Arguments
k
number of shuffled vertices
G
graph object (igraph)
m
number of random permutations
Value
A vector of length 4. The first three elements
are the mean, sd, and minimum for the number of edge
disagreements. The 4th, pmax is a theoretical bound
on maximum error for which graph matching will be
possible.
Examples
1
kshuffle_mean_sd(10, karate, m = 10)
dpmcsuss/gmmle documentation built on July 2, 2020, 6:24 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Examples
Description
Calculate edge disagreements and probability bounds after k vertices are randomly shuffled in a graph G
Usage
1 | kshuffle_mean_sd(k, G, m = 1000)
|
Arguments
k |
number of shuffled vertices |
G |
graph object (igraph) |
m |
number of random permutations |
Value
A vector of length 4. The first three elements are the mean, sd, and minimum for the number of edge disagreements. The 4th, pmax is a theoretical bound on maximum error for which graph matching will be possible.
Examples
1 | kshuffle_mean_sd(10, karate, m = 10)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.