<｜begin▁of▁sentence｜>### Instruction:
Given the requirement to study the effects of correlation in random graphs, how can we generate a pair of correlated ErdÅ‘s-RÃ©nyi graphs with 5 vertices, with each edge having a 50% chance of existing, and the graphs having a correlation of 0.3, ensuring that the graphs are undirected and do not contain self-loops?
### Response:
import numpy as np
from graspologic.simulations import er_corr

np.random.seed(2)
n = 5
p = 0.5
r = 0.3
G1, G2 = er_corr(n, p, r, directed=False, loops=False)
print(G1)
print(G2)
<|EOT|>
