<｜begin▁of▁sentence｜>### Instruction:
Given two community structures of a graph with 100 nodes created with different community detection methods (e.g., the multilevel algorithm and the Infomap algorithm), can you calculate the split-join distance between these two structures using compare_communities method with 'split-join' in igraph to assess their similarity?
### Response:
from igraph import Graph

# Create a Graph
g = Graph.Erdos_Renyi(n=100, p=0.05)

# Perform community detection
community1 = g.community_multilevel()
community2 = g.community_infomap()

# Convert communities to membership lists
membership1 = community1.membership
membership2 = community2.membership

# Calculate split-join distance between the two community structures
from igraph import compare_communities
split_join = compare_communities(membership1, membership2, method='split-join', remove_none=True)

print(f'Split-Join Distance: {split_join}')
<|EOT|>
