sample_correlated_gnp_pair: Sample correlated G(n,p) random graphs
Description
Sample a pair of correlated G(n,p) random graphs with correlation between
two graphs being corr and edge probability being p.
Usage
sample_correlated_gnp_pair(n, corr, p, ncore = n, permutation = 1:n, ...)
Value
sample_correlated_gnp_pair returns a list of two igraph object, named
graph1 and graph2, whose adjacency matrix entries
are correlated with corr. If sample two graphs with junk vertices, the first
ncore vertices are core vertices and the rest are junk vertices.
Arguments
n
An integer. Number of total vertices for the sampled graphs.
corr
A number. The target Pearson correlation between the adjacency matrices
of the generated graphs. It must be in [0,1] interval.
p
A number. Edge probability between two vertices. It must be in open
[0,1] interval.
ncore
An integer. Number of core vertices.
permutation
A numeric vector to permute second graph.
...
Passed to sample_gnp.
References
V. Lyzinski and D. E. Fishkind and C. E. Priebe (2014), Seeded Graph Matching
for Correlated Erdos-Renyi Graphs.J. Mach. Learn. Res., pages 3513-3540.