<｜begin▁of▁sentence｜>### Instruction:
Given the Political Blogs graph in a GML file named 'polblogs.gml', can you demonstrate how to use the DEMON algorithm with the community discovery library cdlib to identify overlapping communities with a merging threshold epsilon of 0.25 and a minimum community size of 3? And, how do you represent the detected communities?
### Response:
import networkx as nx
from cdlib import algorithms

# Load the political blogs graph
g = nx.read_gml('polblogs.gml')

# Apply DEMON algorithm with epsilon = 0.25 and minimum community size = 3
coms = algorithms.demon(g, epsilon=0.25, min_com_size=3)

# Print results
print(coms.to_node_community_map())
<|EOT|>
