<｜begin▁of▁sentence｜>### Instruction:
Given a G(n,p) random graph with 100 nodes and a probability of 0.05 for edge creation between nodes, can you use the EdMot model to detect communities, assuming we want to extract 2 components with a motif edge cut-off value of 50 and a random seed value of 42?
### Response:
import networkx as nx
from karateclub import EdMot

# Create a graph
G = nx.gnp_random_graph(100, 0.05)

# Initialize EdMot model with desired parameters
model = EdMot(component_count=2, cutoff=50, seed=42)

# Fit the model to the graph
model.fit(G)

# Get the cluster memberships
memberships = model.get_memberships()
print(memberships)
<|EOT|>
