EPFL

Algo+LMA

- Read about attacks on anonymized networks: propagation algorithms of attacks, injecting a small graph algorithms and anonymization techniques such us k-anonymization
- Candidacy Exam

- Learned current results on the question when the anonymization of the network is possible (“On the Privacy of Anonymized Networks” by P.Pedarsani and M.Grossglauser). Tried to generalize the result described in the paper
- Gave the review on the Differential Privacy topic in the Netdynx reading group

- Prepared materials for Course “Project Technologies de l'informationation”.
- Introduced a function which measures a quality of mapping between two graphs randomly sampled from G(n,p). This function supposed to help to identify the identity mapping between sampled graphs

- Candidacy Exam
- Run experiments to investigate the introduced function

- Run experiments to demonstrate that the probability of an error (in identification of identity mapping) is small and the function behave better then others (e.g. degree distribution matching)
- Read the paper “Bootstrap percolation on G(n,p)” by S.Janson et al. Formulated the model for a propagation attack algorithm by anology with the paper

- Presented an introduction to a Graphical models in the Netdynx reading group