<｜begin▁of▁sentence｜>### Instruction:
Given a random graph generated using the Erdős-Rényi model with 10 vertices and 20 edges, can igraph be used to compute the average local transitivity, where vertices with less than two neighbors are counted as having zero transitivity?
### Response:
import igraph as ig

# Generate a random graph with 10 vertices and 20 edges
g = ig.Graph.Erdos_Renyi(n=10, m=20)

# Calculate the average local transitivity (clustering coefficient)
average_transitivity = g.transitivity_avglocal_undirected(mode='zero')
print('Average local transitivity:', average_transitivity)
<|EOT|>
