sample_a_move_ERSBM {GoodFitSBM}

Sampling a graph through a Markov move (basis) for ERSBM

Description

sample_a_move_ERSBM to sample a graph in the same fiber; sampling according to the ERSBM (Karwa et al. (2023))

Usage

sample_a_move_ERSBM(C, G_current)

Arguments

C

a positive integer vector of size n for block assignments of each node; from 1 to K (no of blocks)

G_current

an igraph object which is an undirected graph with no self loop

Value

A graph

sampled graph

the sampled graph after one move as per the ERSBM

References

Karwa et al. (2023). "Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels", Journal of the Royal Statistical Society Series B: Statistical Methodology, doi:10.1093/jrsssb/qkad084

See Also

goftest_ERSBM() performs the goodness-of-fit test for the ERSBM, where graphs are being sampled

Examples

RNGkind(sample.kind = "Rounding")
set.seed(1729)

# We model a network with 3 even classes
n1 = 5
n2 = 5
n3 = 5

# Generating block assignments for each of the nodes
n = n1 + n2 + n3
class = rep(c(1, 2, 3), c(n1, n2, n3))

# Generating the adjacency matrix of the network
# Generate the matrix of connection probabilities
cmat = matrix(
  c(
    10, 0.05, 0.05,
    0.05, 10, 0.05,
    0.05, 0.05, 10
  ),
  ncol = 3,
  byrow = TRUE
)
pmat = cmat / n

# Creating the n x n adjacency matrix
adj <- matrix(0, n, n)
for (i in 2:n) {
  for (j in 1:(i - 1)) {
    p = pmat[class[i], class[j]] # We find the probability of connection with the weights
    adj[i, j] = rbinom(1, 1, p) # We include the edge with probability p
  }
}

adjsymm = adj + t(adj)

# graph from the adjacency matrix
G = igraph::graph_from_adjacency_matrix(adjsymm, mode = "undirected", weighted = NULL)

# sampling a Markov move for the ERSBM
G_sample = sample_a_move_ERSBM(class, G)

# plotting the sampled graph
plot(G_sample, main = "The sampled graph after one Markov move for ERSBM")