L. Aujourd-'hui and . Données-sont-produites-et-collectées-À-un, L'analyse des énormes masses de données apporte des avantages sans précédents, mais menace également la vie privée des personnes. Nous devons faire face au défi paradoxal d'apprendre des informations utiles sur une population [35] sans rien apprendre sur un individu Beaucoup de solutions ont été proposées pour résoudre ce paradoxe, mais pour chaque solution proposée de nouvelles vulnérabilités ont été trouvées. A la différence des paradigmes précédents, la vie privée différentielle nous fournit une avancée prometteuse: peu importe ce que l'adversaire sait sur vous à partir de sources d'information auxiliaires

D. Le-principe-de-la-vie-privée-différentielle-est-vérifié-si-deux-bases-de-données, D. Tel-que, and D. D?{x}, est-à-dire D et D ne diffèrent que par un seul élément, les distributions de probabilités sur les résultats de D et D fournies par la vie privée différentielle sont " essentiellement les mêmes " . Plus formellement, Definition B.1. Un algorithme randomisé A est (, ?)-differentially private ((, ?)-DP en raccourci ) si, pour deux ensembles quelconques de données voisins D and D , et pour tout résultat O ? Range(A)

J. Abawajy, M. I. Ninggal, and T. Herawan, Privacy Preserving Social Network Data Publication, IEEE Communications Surveys & Tutorials, vol.18, issue.3, 2016.
DOI : 10.1109/COMST.2016.2533668

M. E. Andrés, N. E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, Geoindistinguishability: Differential privacy for location-based systems, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, pp.901-914, 2013.

L. Backstrom, C. Dwork, and J. Kleinberg, Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography, WWW, pp.181-190, 2007.

N. T. Bailey, The mathematical theory of infectious diseases and its applications, 1975.

S. Banerjee, N. Hegde, and L. Massoulie, The price of privacy in untrusted recommender systems. Selected Topics in Signal Processing, IEEE Journal, issue.97, pp.1319-1331, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01226756

B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. Mcsherry et al., Privacy, accuracy, and consistency too, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, pp.273-282, 2007.
DOI : 10.1145/1265530.1265569

J. Blocki, A. Blum, A. Datta, and O. Sheffet, Differentially private data analysis of social networks via restricted sensitivity, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, ITCS '13, pp.87-96, 2013.
DOI : 10.1145/2422436.2422449

V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.10008, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

P. Boldi, F. Bonchi, A. Gionis, and T. Tassa, Injecting uncertainty in graphs for identity obfuscation, Proceedings of the VLDB Endowment, 2012.
DOI : 10.14778/2350229.2350254
URL : http://arxiv.org/abs/1208.4145

P. Boldi, M. Rosa, and S. Vigna, HyperANF, Proceedings of the 20th international conference on World wide web, WWW '11, pp.625-634, 2011.
DOI : 10.1145/1963405.1963493

F. Bonchi, A. Gionis, and T. Tassa, Identity obfuscation in graphs through the information theoretic lens, 2011 IEEE 27th International Conference on Data Engineering, pp.924-935, 2011.
DOI : 10.1109/ICDE.2011.5767905

C. Borgs, J. Chayes, and A. Smith, Private graphon estimation for sparse graphs, Advances in Neural Information Processing Systems, pp.1369-1377, 2015.

U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer et al., On modularity-np-completeness and beyond, 2006.

A. Broder and M. Mitzenmacher, Network Applications of Bloom Filters: A Survey, Internet Mathematics, vol.1, issue.4, pp.485-509, 2004.
DOI : 10.1080/15427951.2004.10129096

A. Campan, Y. Alufaisan, T. M. Truta, and T. Richardson, Preserving communities in anonymized social networks, Transactions on Data Privacy, vol.8, issue.1, pp.55-87, 2015.

A. Campan and T. M. Truta, A clustering approach for data and structural anonymity in social networks, Privacy, Security, and Trust in KDD Workshop (PinKDD), 2008.

T. Chakraborty, S. Srinivasan, N. Ganguly, A. Mukherjee, and S. Bhowmick, On the permanence of vertices in network communities, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.1396-1405, 2014.
DOI : 10.1145/2623330.2623707

K. Chatzikokolakis, C. Palamidessi, and M. Stronati, Abstract, Proceedings on Privacy Enhancing Technologies, pp.156-170, 2015.
DOI : 10.1515/popets-2015-0023

R. Chen, B. C. Fung, P. S. Yu, and B. C. Desai, Correlated network data publication via differential privacy, The VLDB Journal, vol.2, issue.1, pp.653-676, 2014.
DOI : 10.1007/s00778-013-0344-8

S. Chen and S. Zhou, Recursive mechanism, Proceedings of the 2013 international conference on Management of data, SIGMOD '13, pp.653-664, 2013.
DOI : 10.1145/2463676.2465304

J. Cheng, A. W. Fu, and J. Liu, K-isomorphism, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, 2010.
DOI : 10.1145/1807167.1807218

A. Clauset, C. Moore, and M. E. Newman, Hierarchical structure and the prediction of missing links in networks, Nature, vol.104, issue.7191, pp.98-101, 2008.
DOI : 10.1038/nature06830

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, p.66111, 2004.
DOI : 10.1103/PhysRevE.70.066111
URL : http://arxiv.org/abs/cond-mat/0408187

G. Cormode, C. Procopiuc, D. Srivastava, and T. T. Tran, Differentially private summaries for sparse data, Proceedings of the 15th International Conference on Database Theory, ICDT '12, pp.299-311, 2012.
DOI : 10.1145/2274576.2274608
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.7652

M. Coscia, F. Giannotti, and D. Pedreschi, A classification for community discovery methods in complex networks, Statistical Analysis and Data Mining, vol.78, issue.5, pp.512-546, 2011.
DOI : 10.1002/sam.10133

J. Creusefond, T. Largillier, and S. Peyronnet, On the evaluation potential of quality functions in community detection for different contexts Management of probabilistic data: foundations and challenges, International Conference and School on Network Science PODS, pp.111-125, 2007.

L. Danon, A. Diaz-guilera, J. Duch, and A. Arenas, Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, vol.2005, issue.09, p.9008, 2005.
DOI : 10.1088/1742-5468/2005/09/P09008
URL : http://arxiv.org/abs/cond-mat/0505245

A. De, Lower Bounds in Differential Privacy, Theory of Cryptography, pp.321-338, 2012.
DOI : 10.1007/978-3-642-28914-9_18
URL : http://arxiv.org/abs/1107.2183

I. Dinur and K. Nissim, Revealing information while preserving privacy, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.202-210, 2003.
DOI : 10.1145/773153.773173
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.1298

C. Dwork, A firm foundation for private data analysis, Communications of the ACM, vol.54, issue.1, pp.86-95, 2011.
DOI : 10.1145/1866739.1866758
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.9141

C. Dwork, F. Mcsherry, K. Nissim, and A. Smith, Calibrating Noise to Sensitivity in Private Data Analysis, TCC, pp.265-284, 2006.
DOI : 10.1007/11681878_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.9267

C. Dwork and A. Roth, The Algorithmic Foundations of Differential Privacy, Foundations and Trends?? in Theoretical Computer Science, vol.9, issue.3-4, pp.211-407, 2014.
DOI : 10.1561/0400000042

A. M. Fard, K. Wang, and P. S. Yu, Limiting link disclosure in social network analysis through subgraph-wise perturbation, Proceedings of the 15th International Conference on Extending Database Technology, EDBT '12, 2012.
DOI : 10.1145/2247596.2247610
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.1962

T. Fawcett, An introduction to roc analysis. Pattern recognition letters, pp.861-874, 2006.
DOI : 10.1016/j.patrec.2005.10.010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.2144

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002
URL : http://arxiv.org/abs/0906.0612

A. J. Ganesh, A. Kermarrec, and L. Massoulié, Peer-to-peer membership management for gossip-based protocols. Computers, IEEE Transactions on, vol.52, issue.2, pp.139-149, 2003.
DOI : 10.1109/tc.2003.1176982
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.7026

A. Ghosh, T. Roughgarden, and M. Sundararajan, Universally Utility-maximizing Privacy Mechanisms, SIAM Journal on Computing, vol.41, issue.6, pp.1673-1693, 2012.
DOI : 10.1137/09076828X
URL : http://arxiv.org/abs/0811.2841

G. Giakkoupis, R. Guerraoui, A. Jégou, A. Kermarrec, and N. Mittal, Privacyconscious information diffusion in social networks, Distributed Computing, pp.480-496, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01207162

R. L. Graham, Concrete Mathematics: A Foundation for Computer Science, Pearson Education India, 1994.
DOI : 10.1063/1.4822863

A. Gupta, A. Roth, and J. Ullman, Iterative Constructions and Private Data Release, Theory of Cryptography, pp.339-356, 2012.
DOI : 10.1007/978-3-642-28914-9_19
URL : http://arxiv.org/abs/1107.3731

M. Hay, C. Li, G. Miklau, and D. Jensen, Accurate Estimation of the Degree Distribution of Private Networks, 2009 Ninth IEEE International Conference on Data Mining, pp.169-178, 2009.
DOI : 10.1109/ICDM.2009.11

M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, Resisting structural reidentification in anonymized social networks, 2008.
DOI : 10.14778/1453856.1453873
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6866

M. Hay, V. Rastogi, G. Miklau, and D. Suciu, Boosting the accuracy of differentially private histograms through consistency, Proceedings of the VLDB Endowment, pp.1021-1032, 2010.
DOI : 10.14778/1920841.1920970

D. A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, Proceedings of the IRE, pp.1098-1101, 1952.
DOI : 10.1109/JRPROC.1952.273898

S. P. Kasiviswanathan, K. Nissim, S. Raskhodnikova, and A. Smith, Analyzing Graphs with Node Differential Privacy, Theory of Cryptography, pp.457-476, 2013.
DOI : 10.1007/978-3-642-36594-2_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5204

K. Kenthapadi, A. Korolova, I. Mironov, and N. Mishra, Privacy via the johnsonlindenstrauss transform, 2012.

D. Kifer and A. Machanavajjhala, No free lunch in data privacy, Proceedings of the 2011 international conference on Management of data, SIGMOD '11, pp.193-204, 2011.
DOI : 10.1145/1989323.1989345

J. Lee and C. Clifton, Differential identifiability, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pp.1041-1049, 2012.
DOI : 10.1145/2339530.2339695

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, 2007.
DOI : 10.1145/1217299.1217301

N. Li, T. Li, and S. Venkatasubramanian, t-Closeness: Privacy Beyond k-Anonymity and l-Diversity, 2007 IEEE 23rd International Conference on Data Engineering, pp.106-115, 2007.
DOI : 10.1109/ICDE.2007.367856
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.824

K. Liu and E. Terzi, Towards identity anonymization on graphs, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.93-106, 2008.
DOI : 10.1145/1376616.1376629
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3416

L. Lü, M. Medo, C. H. Yeung, Y. Zhang, Z. Zhang et al., Recommender systems, Physics Reports, vol.519, issue.1, pp.1-49, 2012.
DOI : 10.1016/j.physrep.2012.02.006
URL : https://hal.archives-ouvertes.fr/hal-01306790

L. Lü and T. Zhou, Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, pp.1150-1170, 2011.

W. Lu and G. Miklau, Exponential random graph estimation under differential privacy, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.921-930, 2014.
DOI : 10.1145/2623330.2623683

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, -diversity, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, p.3, 2007.
DOI : 10.1145/1217299.1217302

P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat, Systematic topology analysis and generation using degree correlations, SIGCOMM. ACM, 2006.
DOI : 10.1145/1159913.1159930
URL : http://arxiv.org/abs/cs/0605007

F. D. Malliaros and M. Vazirgiannis, Clustering and community detection in directed networks: A survey, Physics Reports, vol.533, issue.4, pp.95-142, 2013.
DOI : 10.1016/j.physrep.2013.08.002
URL : http://arxiv.org/abs/1308.0971

F. Mcsherry and K. Talwar, Mechanism design via differential privacy Privacy integrated queries: an extensible platform for privacy-preserving data analysis, FOCS SIGMOD, pp.94-103, 2007.

A. Medus, G. Acuna, and C. Dorso, Detection of community structures in networks via global optimization. Physica A: Statistical Mechanics and its Applications, pp.593-604, 2005.

D. Mir and R. N. Wright, A differentially private estimator for the stochastic Kronecker graph model, Proceedings of the 2012 Joint EDBT/ICDT Workshops on, EDBT-ICDT '12, pp.167-176, 2012.
DOI : 10.1145/2320765.2320818

P. Mittal, C. Papamanthou, and D. Song, Preserving link privacy in social network based systems, NDSS, 2013.

A. Moffat, R. M. Neal, and I. H. Witten, Arithmetic coding revisited, ACM Transactions on Information Systems, vol.16, issue.3, pp.256-294, 1998.
DOI : 10.1145/290159.290162
URL : http://researchcommons.waikato.ac.nz/bitstream/10289/78/1/content.pdf

Y. Moreno, R. Pastor-satorras, and A. Vespignani, Epidemic outbreaks in complex heterogeneous networks, The European Physical Journal B, vol.26, issue.4, pp.521-529, 2002.
DOI : 10.1140/epjb/e20020122
URL : http://arxiv.org/abs/cond-mat/0107267

Y. Mülle, C. Clifton, and K. Böhm, Privacy-integrated graph clustering through differential privacy, 2015.

A. Narayanan, E. Shi, and B. I. Rubinstein, Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge, The 2011 International Joint Conference on Neural Networks, pp.1825-1834, 2011.
DOI : 10.1109/IJCNN.2011.6033446
URL : http://arxiv.org/abs/1102.4374

A. Narayanan and V. Shmatikov, Robust De-anonymization of Large Sparse Datasets, 2008 IEEE Symposium on Security and Privacy (sp 2008), pp.111-125, 2008.
DOI : 10.1109/SP.2008.33

A. Narayanan and V. Shmatikov, De-anonymizing Social Networks, 2009 30th IEEE Symposium on Security and Privacy, pp.173-187, 2009.
DOI : 10.1109/SP.2009.22
URL : http://arxiv.org/abs/0903.3276

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.69, issue.6, p.66133, 2004.
DOI : 10.1103/PhysRevE.69.066133
URL : http://arxiv.org/abs/cond-mat/0309508

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.69, issue.2, p.26113, 2004.
DOI : 10.1103/PhysRevE.69.026113
URL : http://arxiv.org/abs/cond-mat/0308217

H. H. Nguyen, A. Imine, and M. Rusinowitch, Anonymizing Social Graphs via Uncertainty Semantics, Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIA CCS '15, pp.495-506, 2015.
DOI : 10.1145/2714576.2714584
URL : https://hal.archives-ouvertes.fr/hal-01108437

H. H. Nguyen, A. Imine, and M. Rusinowitch, Differentially Private Publication of Social Graphs at Linear Cost, Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, ASONAM '15, 2015.
DOI : 10.1145/2808797.2809385
URL : https://hal.archives-ouvertes.fr/hal-01179528

H. H. Nguyen, A. Imine, and M. Rusinowitch, Detecting Communities under Differential Privacy, Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society , WPES'16, 2016.
DOI : 10.1145/2994620.2994624
URL : https://hal.archives-ouvertes.fr/hal-01393266

K. Nissim, S. Raskhodnikova, and A. Smith, Smooth sensitivity and sampling in private data analysis, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.75-84, 2007.
DOI : 10.1145/1250790.1250803
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.4340

C. R. Palmer, P. B. Gibbons, and C. Faloutsos, ANF, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.81-90, 2002.
DOI : 10.1145/775047.775059

R. Pastor-satorras and A. Vespignani, Epidemic spreading in scale-free networks. Physical review letters, p.3200, 2001.
DOI : 10.1103/physrevlett.86.3200
URL : http://arxiv.org/abs/cond-mat/0010317

P. Pons and M. Latapy, Computing communities in large networks using random walks, Computer and Information Sciences-ISCIS 2005, pp.284-293, 2005.
DOI : 10.7155/jgaa.00124
URL : http://arxiv.org/abs/cond-mat/0412368

A. Prat-pérez, D. Dominguez-sal, and J. Larriba-pey, High quality, scalable and parallel community detection for large real graphs, Proceedings of the 23rd international conference on World wide web, WWW '14, pp.225-236, 2014.
DOI : 10.1145/2566486.2568010

U. N. Raghavan, R. Albert, and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks, Physical Review E, vol.76, issue.3, p.36106, 2007.
DOI : 10.1103/PhysRevE.76.036106

S. Raskhodnikova and A. Smith, Efficient lipschitz extensions for high-dimensional graph statistics and node private degree distributions, 2015.
DOI : 10.1109/focs.2016.60

J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, Physical Review E, vol.74, issue.1, p.16110, 2006.
DOI : 10.1103/PhysRevE.74.016110
URL : http://arxiv.org/abs/cond-mat/0603718

M. Rosvall and C. T. Bergstrom, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences, pp.1118-1123, 2008.
DOI : 10.1073/pnas.0307852100

A. Sala, L. Cao, C. Wilson, R. Zablit, H. Zheng et al., Measurement-calibrated graph models for social network experiments, Proceedings of the 19th international conference on World wide web, WWW '10, 2010.
DOI : 10.1145/1772690.1772778
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.1021

A. Sala, X. Zhao, C. Wilson, H. Zheng, and B. Y. Zhao, Sharing graphs using differentially private graph models, Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference, IMC '11, pp.81-98, 2011.
DOI : 10.1145/2068816.2068825
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.4030

E. Shen and T. Yu, Mining frequent graph patterns with differential privacy, Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '13, pp.545-553, 2013.
DOI : 10.1145/2487575.2487601
URL : http://arxiv.org/abs/1301.7015

R. Shokri, P. Pedarsani, G. Theodorakopoulos, and J. Hubaux, Preserving privacy in collaborative filtering through distributed aggregation of offline profiles, Proceedings of the third ACM conference on Recommender systems, RecSys '09, pp.157-164, 2009.
DOI : 10.1145/1639714.1639741

R. Shokri, G. Theodorakopoulos, J. Boudec, and J. Hubaux, Quantifying Location Privacy, 2011 IEEE Symposium on Security and Privacy, pp.247-262, 2011.
DOI : 10.1109/SP.2011.18
URL : https://hal.archives-ouvertes.fr/hal-01266229

G. Smith, On the Foundations of Quantitative Information Flow, Foundations of Software Science and Computational Structures, pp.288-302, 2009.
DOI : 10.1137/060651380

D. Su, J. Cao, N. Li, E. Bertino, and H. Jin, Differentially private k-means clustering. arXiv preprint, 2015.
DOI : 10.1145/2857705.2857708
URL : http://arxiv.org/abs/1504.05998

L. Sweeney, k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.2, issue.3, pp.557-570, 2002.
DOI : 10.1109/RISP.1993.287632

C. Tai, P. S. Yu, D. Yang, M. Chen, and D. J. Cohen, Privacy-preserving social network publication against friendship attacks Anonymization of centralized and distributed social networks by sequential clustering, In KDD. ACM Knowledge and Data Engineering IEEE Transactions on, vol.25, issue.2, pp.311-324, 2011.

A. Vázquez, Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations, Physical Review E, vol.67, issue.5, p.56104, 2003.
DOI : 10.1103/PhysRevE.67.056104

S. Voulgaris, D. Gavidia, and M. Van-steen, CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, Journal of Network and Systems Management, vol.21, issue.6, pp.197-217, 2005.
DOI : 10.1007/s10922-005-4441-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.4965

Y. Wang and X. Wu, Preserving differential privacy in degree-correlation based graph generation, TDP, vol.6, issue.2, p.127, 2013.

Y. Wang, X. Wu, and L. Wu, Differential Privacy Preserving Spectral Graph Analysis, 2013.
DOI : 10.1007/978-3-642-37456-2_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.6582

L. Wu, X. Ying, and X. Wu, Reconstruction from Randomized Graph via Low Rank Approximation, SDM, pp.60-71, 2010.
DOI : 10.1137/1.9781611972801.6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.1209

W. Wu, Y. Xiao, W. Wang, Z. He, and Z. Wang, k-symmetry model for identity anonymization in social networks, Proceedings of the 13th International Conference on Extending Database Technology, EDBT '10, pp.111-122, 2010.
DOI : 10.1145/1739041.1739058
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.6831

X. Wu, X. Ying, K. Liu, and L. Chen, A Survey of Privacy-Preservation of Graphs and Social Networks, Managing and mining graph data, pp.421-453, 2010.
DOI : 10.1007/978-1-4419-6045-0_14

Q. Xiao, R. Chen, and K. Tan, Differentially private network data release via structural inference, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.911-920, 2014.
DOI : 10.1145/2623330.2623642

J. Yang and J. Leskovec, Defining and evaluating network communities based on groundtruth, ICDM, pp.745-754, 2012.
DOI : 10.1145/2350190.2350193
URL : http://arxiv.org/abs/1205.6233

X. Ying and X. Wu, Randomizing Social Networks: a Spectrum Preserving Approach, SDM, pp.739-750, 2008.
DOI : 10.1137/1.9781611972788.67
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6647

X. Ying and X. Wu, On link privacy in randomizing social networks, Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.28-39, 2009.
DOI : 10.1007/978-3-642-01307-2_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4519

X. Ying and X. Wu, On link privacy in randomizing social networks, Knowledge and Information Systems, vol.19, issue.2, pp.645-663, 2011.
DOI : 10.1007/s10115-010-0353-5

J. Zhang, G. Cormode, C. M. Procopiuc, D. Srivastava, and X. Xiao, Private Release of Graph Statistics using Ladder Functions, Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD '15, pp.731-745, 2015.
DOI : 10.1145/2723372.2737785

E. Zheleva and L. Getoor, To join or not to join, Proceedings of the 18th international conference on World wide web, WWW '09, pp.531-540, 2009.
DOI : 10.1145/1526709.1526781

B. Zhou and J. Pei, Preserving Privacy in Social Networks Against Neighborhood Attacks, 2008 IEEE 24th International Conference on Data Engineering, pp.506-515, 2008.
DOI : 10.1109/ICDE.2008.4497459
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.1559

L. Zou, L. Chen, and M. T. Özsu, k-automorphism, Proceedings of the VLDB Endowment, vol.2, issue.1, 2009.
DOI : 10.14778/1687627.1687734