get_disag_stat: Disagreements simulation

In dpmcsuss/gmmle:

Description

Simulations to test for the difficulty to match a graph by randomly permuting nodes. get_disag_stat runs on one graph and par_run_all_disag runs the simulation in the manuscript in parallel.

Usage

get_disag_stat(graph, cl = NULL, m = 500)

par_run_all_disag(nclust = 7, ask = TRUE)

Arguments

graph	iGraph object or string corresponding to graph data in package
cl	Cluster to run the shuffling on.
m	Number of shuffles to perform to compute statistics
nclust	Number of parallel clusters to create via parallel::makeCluster
ask	Whether to warn about long run times.

Value

Tibble with 7 columns K: number nodes permuted, on a logarithmic grid avedis: average distance between original and permuted graph sd: standard deviation of distance, min: minimum distance pthresh: estimated bound on error tolerance for graph matching data: name of data if graph is a string n: number of nodes in provided graph

Functions

• par_run_all_disag:

Examples

get_disag_stat("karate", m = 10)

dpmcsuss/gmmle documentation built on July 2, 2020, 6:24 p.m.