<｜begin▁of▁sentence｜>### Instruction:
Given a graph representing a power grid which is contained within a GML file named power.gml, can you apply the Louvain community detection algorithm using cdlib to identify the communities within the network? Additionally, can you compute the size of each identified community?
### Response:
import networkx as nx
from cdlib import algorithms
from cdlib import evaluation

# Load the power grid graph
g = nx.read_gml('power.gml')

# Perform community detection using the Louvain algorithm
communities = algorithms.louvain(g)

# Evaluate the size (number of nodes) in each community
sizes = evaluation.size(g, communities)

print(sizes)
<|EOT|>
