Numeric scalar, the number of vertices for the sampled graphs.

corr

A scalar in the unit interval, the target Pearson correlation
between the adjacency matrices of the original the generated graph (the
adjacency matrix being used as a vector).

p

A numeric scalar, the probability of an edge between two vertices,
it must in the open (0,1) interval.

directed

Logical scalar, whether to generate directed graphs.

permutation

A numeric vector, a permutation vector that is applied on
the vertices of the first graph, to get the second graph. If NULL,
the vertices are not permuted.

Value

A list of two igraph objects, named graph1 and
graph2, which are two graphs whose adjacency matrix entries are
correlated with corr.

Details

Please see the reference given below.

References

Lyzinski, V., Fishkind, D. E., Priebe, C. E. (2013). Seeded
graph matching for correlated Erdos-Renyi graphs.
http://arxiv.org/abs/1304.7844