<｜begin▁of▁sentence｜>### Instruction:
Given a Newman-Watts-Strogatz small-world graph with 100 nodes, each connected to 3 nearest neighbors in a ring topology, and with a 0.5 probability of adding a new edge, can you use BoostNE to obtain its node embedding?
### Response:
import networkx as nx
from karateclub import BoostNE

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

# Initialize BoostNE
boostne = BoostNE(dimensions=8, iterations=16, order=2, alpha=0.01, seed=42)

# Fit BoostNE modeloostne.fit(G)

# Get the embedding
embedding = boostne.get_embedding()
print(embedding)
<|EOT|>
