def remove_by_min_overlapping_users(keen_keen_graph, min_overlapping_user):
    """It only keeps the edges whose weight >= min_overlapping_user"""
    filtered = {}
    for ka, ints in keen_keen_graph.items():
        new_ints = {kb: n_users for kb, n_users in ints.items() if n_users >= min_overlapping_user}
        if new_ints:
            filtered[ka] = new_ints
    return filtered