<｜begin▁of▁sentence｜>### Instruction:
Given a Newman-Watts-Strogatz small-world graph with 100 nodes, each connected to its 3 nearest neighbors in ring topology, and rewiring probability 0.5, can you use EgoNetSplitter to find the overlapping cluster memberships of the nodes in the graph?
### Response:
import networkx as nx
from karateclub import EgoNetSplitter

# Create a sample graph
G = nx.newman_watts_strogatz_graph(100, 3, 0.5)

# Initialize EgoNetSplitter model with default parameters
model = EgoNetSplitter()

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

# Get the cluster membership of nodes
memberships = model.get_memberships()

print(memberships)
<|EOT|>
