<｜begin▁of▁sentence｜>### Instruction:
Given the parameters for a Watts-Strogatz small-world network with a one-dimensional lattice of 30 nodes, each connected to 4 nearest neighbors, with a 10% chance of rewiring each edge, no loops, and no multiple edges, how can you generate and summarize the network using igraph in Python?
### Response:
import igraph as ig

# Parameters for Watts-Strogatz small-world network
dim = 1             # Dimension of the lattice
size = 30           # Size of the lattice along each dimension
nei = 4             # Each node is connected to 'nei' nearest neighbors in ring topology
p = 0.1            # The probability of rewiring each edge
loops = False      # No loop edges
multiple = False   # No multiple edges

# Generate the network
g = ig.Graph.Watts_Strogatz(dim, size, nei, p, loops=loops, multiple=multiple)

# Print the summary of the graph
g.summary()
<|EOT|>
