<｜begin▁of▁sentence｜>### Instruction:
Given a graph of Books about US politics which you can read from a gml file named polbooks.gml, can you use the k-clique community detection algorithm to find communities using the percolation method with cliques of size 3?
### Response:
from cdlib import algorithms
import networkx as nx

G = nx.read_gml('polbooks.gml')
communities = algorithms.kclique(G, k=3)
<|EOT|>
