EAGA Algorithm

EAGA (Evolutionary Algorithm for Graph Anonymization) Algorithm

EAGA is an algorithm for k-degree anonymization on networks. It uses the concept of evolutionary algorithm to anonymize the degree sequence of the network. Then, it applies edge swap to modify graph structure in order to implement to the anonymized k-degree sequence.

It was presented in:

Abstract: In recent years there has been a significant increase in the use of graphs as a tool for representing information. It is very important to preserve the privacy of users when one wants to publish this information, especially in the case of social graphs. In this case, it is essential to implement an anonymization process in the data in order to preserve users’ privacy. In this paper we present an algorithm for graph anonymization, called Evolutionary Algorithms for Graph Anonymization (EAGA), based on edge modifications to preserve the k-anonymity model.

The code (implemented in Java) can be downloaded:

For any trouble or comment, please feel free to contact me.

2 Responses to EAGA Algorithm

  1. Can you give me example dataset to which this code works.

    • This algorithm only works with small networks (less than 1,000 nodes).

      It works, for instance, on Zachary’s Karate Club (a very well-known network in community detection algorithms) using GML format. You can download it here:

      I suggest you to use UMGA, which also based on k-degree anonymity and it is able to anonymize large networks with thousands or millions of vertices and edges. Source code is also available here.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s