1. A method for providing an anonymized graph, comprising: receiving, by a processor, a communications graph that encodes a plurality of types of interactions between a plurality of user entities; partitioning, by the processor, the plurality of user entities into a plurality of classes; applying, by the processor, a type of anonymization to the communications graph, wherein the type of anonymization comprises a label list approach that allocates a label list to each of the plurality of user entities, wherein a plurality of labels in the label list for one of the user entities comprise: labels of other user entities within a same class as the one user entity and a true label for the one user entity; and providing, by the processor, the anonymized graph linking two or more of the plurality of user entities to a plurality of interactions, wherein the anonymized graph comprises: a first set comprising the plurality of user entities; a second set comprising the plurality of interactions; and a plurality of edges linking two or more of the plurality of user entities in the first set to an interaction in the second set.