简短的回答是它有点繁琐,您需要决定使用什么策略来向上或向下舍入边数。
小世界
对于小世界,因为它是一个高度有序的结构,所以很难准确指定您想要多少条边,因为每个节点以相同的度数开始并且您随机重新布线。我能想到的最好的办法是制作下一个最大的网络并随机删除边缘:
n <- 16809
m <- 173393
# Work out how theye divide into each other
rem <- m %% n
div <- m %/% n
set.seed(123)
if(rem != 0) {
g <- sample_smallworld(1, n, div+1, p = 0.001)
# Randomly delete the unwanted edges. Should be quite homegenous
g <- delete_edges(g, sample(1:gsize(g), size = gsize(g) - m))
} else {
g <- sample_smallworld(1, n, div, p = 0.001)
}
优先附件
同样,对于 BA 网络,它需要有序数量的边进入。您可以使用 out.seq 参数指定每一步添加的边数:
# Barabasi - Albert --------------------------------------------------------
genOutSeq <- function(n, m) {
n <- n-1 # Shift it along
rem <- m %% n
c(0, rep(m%/%n + 1, rem), rep(m%/%n, n - rem))
}
n <- 16809
m <- 173393
# This creates the right number of edges but some are multiple
set.seed(11)
g <- sample_pa(n, power = 0.5, out.seq = genOutSeq(n, m),
algorithm = "psumtree-multiple", directed = FALSE)
gsize(g)
set.seed(11)
g <- sample_pa(n, power = 0.5, out.seq = genOutSeq(n, m),
algorithm = "psumtree", directed = FALSE)
# Randomly add the remainder
nMulti <- m - gsize(g) # Number of multiple edges that were removed
for (i in 1:nMulti) {
vPair <- sample(1:n, size = 2)
while (get.edge.ids(g, vPair) > 0) {
add_edges(g, vPair)
vPair <- sample(1:n, size = 2)
}
}
g
如您所见,第一次运行使用了一种生成多重边的算法。我通过随机添加它们来解决这个问题,但这取决于你使用什么策略。