S. Abiteboul, M. Preda, and G. Cobena, Adaptive on-line page importance computation, Proceedings of the twelfth international conference on World Wide Web , WWW '03, pp.280-290, 2003.
DOI : 10.1145/775152.775192

L. A. Adamic and E. Adar, Friends and neighbors on the Web, Social Networks, vol.25, issue.3, pp.211-230, 2003.
DOI : 10.1016/S0378-8733(03)00009-1

Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, Analysis of topological characteristics of huge online social networking services, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.835-844, 2007.
DOI : 10.1145/1242572.1242685

M. Amer-yahia, L. Benedikt, J. Lakshmanan, and . Stoyanovich, Efficient network aware search in collaborative tagging sites, Proceedings of the 34st International Conference on Very Large Databases (VLDB '08), pp.710-721, 2008.

Y. Aumann and Y. Rabani, ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm, SIAM Journal on Computing, vol.27, issue.1, pp.291-301, 1998.
DOI : 10.1137/S0097539794285983
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.2592

L. Backstrom, C. Dwork, and J. Kleinberg, Wherefore art thou r3579x?: anonymized social networks , hidden patterns, and structural steganography, Proceedings of the 16th International Conference on World Wide Web (WWW '07), pp.181-190, 2007.

X. Bai, M. Bertier, R. Guerraoui, A. Kermarrec, and V. Leroy, Gossiping personalized queries, Proceedings of the 13th International Conference on Extending Database Technology, EDBT '10, pp.87-98, 2010.
DOI : 10.1145/1739041.1739055
URL : https://hal.archives-ouvertes.fr/inria-00455643

F. Banaei-kashani and C. Shahabi, SWAM, Proceedings of the Thirteenth ACM conference on Information and knowledge management , CIKM '04, pp.304-313, 2004.
DOI : 10.1145/1031171.1031236

J. Bar-ilan, Google Bombing from a Time Perspective, Journal of Computer-Mediated Communication, vol.33, issue.4, pp.910-938, 2007.
DOI : 10.1111/j.1083-6101.2007.00356.x

J. Baumes, M. Goldberg, M. Hayvanovych, M. Magdon-ismail, W. Wallace et al., Finding Hidden Group Structure in a Stream of Communications, Proceedings of the IEEE International Conference on Intelligence and Security InformaticsISI '06), pp.201-212, 2006.
DOI : 10.1007/11760146_18

M. Bender, T. Crecelius, M. Kacimi, S. Miche, J. X. Parreira et al., Peer-to-peer information search: Semantic, social, or spiritual?, TCDE, vol.30, issue.2, pp.51-60, 2007.

M. Bender, T. Crecelius, M. Kacimi, S. Michel, T. Neumann et al., Exploiting social relations for query expansion and result ranking, 2008 IEEE 24th International Conference on Data Engineering Workshop, pp.501-506, 2008.
DOI : 10.1109/ICDEW.2008.4498369

M. Bertier, D. Frey, R. Guerraoui, A. Kermarrec, and V. Leroy, The Gossple Anonymous Social Network, Proceedings of the 11th International Middleware Conference (Middleware '10), pp.191-211, 2010.
DOI : 10.1007/978-3-642-16955-7_10
URL : https://hal.archives-ouvertes.fr/hal-01055283

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

E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer, Brahms, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.145-154, 2008.
DOI : 10.1145/1400751.1400772

J. Bourgain, On lipschitz embedding of finite metric spaces in Hilbert space, Israel Journal of Mathematics, vol.26, issue.1-2, pp.46-52, 1985.
DOI : 10.1007/BF02776078

S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, vol.30, issue.1-7, pp.107-117, 1998.
DOI : 10.1016/S0169-7552(98)00110-X

M. Carman, M. Baillie, and F. Crestani, Tag data and personalized information retrieval, Proceeding of the 2008 ACM workshop on Search in social media, SSM '08, pp.27-34, 2008.
DOI : 10.1145/1458583.1458591
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.3963

C. Cattuto, D. Benz, A. Hotho, and G. Stumme, Semantic analysis of tag similarity measures in collaborative tagging systems, Proceedings of the 3rd Workshop on Ontology Learning and PopulationOLP3), pp.39-43, 2008.

M. Cha, A. Mislove, and K. P. Gummadi, A measurement-driven analysis of information propagation in the flickr social network, Proceedings of the 18th international conference on World wide web, WWW '09, pp.721-730, 2009.
DOI : 10.1145/1526709.1526806

R. Chellappa and A. Jain, Markov random fields: theory and application, 1993.

G. Chen, C. P. Low, and Z. Yang, Enhancing search performance in unstructured p2p networks based on users' common interest, TPDS, vol.19, issue.6, pp.821-836, 2008.

L. Chen and A. Buja, Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis, Journal of the American Statistical Association, vol.104, issue.485, pp.209-219, 2009.
DOI : 10.1198/jasa.2009.0111

V. Cholvi, P. Felber, and E. Biersack, Efficient search in unstructured peer-to-peer networks, SPAA, pp.271-272, 2004.

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

B. F. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon et al., PNUTS, Proceedings of the VLDB Endowment Semantic overlay networks for p2p systems AP2PC, pp.1277-1288, 2004.
DOI : 10.14778/1454159.1454167

F. Dabek, R. Cox, F. Kaashoek, and R. Morris, Vivaldi: A decentralized network coordinate system, SIGCOMM, pp.15-26, 2004.

P. Domingos and M. Richardson, Markov logic: A unifying framework for statistical relational learning, Proceedings of the ICML '04 Workshop on Statistical Relational Learning and its Connections to Other Fields, pp.49-54, 2004.

P. Eades, A heuristic for graph drawing, Congressus Numerantium, vol.42, pp.149-160, 1984.

N. Eagle and A. Pentland, Reality mining: sensing complex social systems, Personal and Ubiquitous Computing, vol.10, issue.2, pp.255-268, 2006.
DOI : 10.1007/s00779-005-0046-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.9752

A. Evfimievski, J. Gehrke, and R. Srikant, Limiting privacy breaches in privacy preserving data mining, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.211-222, 2003.
DOI : 10.1145/773153.773174

A. Eyal and A. Gal, Self Organizing Semantic Topologies in P2P Data Integration Systems, 2009 IEEE 25th International Conference on Data Engineering, pp.1159-1162, 2009.
DOI : 10.1109/ICDE.2009.190

D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós, Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments, Internet Mathematics, vol.2, issue.3, pp.333-358, 2005.
DOI : 10.1080/15427951.2005.10129104

P. Fraigniaud, E. Lebhar, and Z. Lotker, Recovering the long-range links in augmented graphs, SIROCCO, p.118, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00147536

T. M. Fruchterman and E. M. Reingold, Graph drawing by force-directed placement, Software: Practice and Experience, vol.41, issue.11, 1991.
DOI : 10.1002/spe.4380211102

J. Gao and P. Tan, Converting Output Scores from Outlier Detection Algorithms into Probability Estimates, Sixth International Conference on Data Mining (ICDM'06), pp.212-221, 2006.
DOI : 10.1109/ICDM.2006.43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.1543

L. Getoor, N. Friedman, D. Koller, and B. Taskar, Learning probabilistic models of link structure, Machine Learning, pp.679-707, 2003.

O. Goussevskaia, M. Kuhn, M. Lorenzi, and R. Wattenhofer, From Web to Map: Exploring the World of Music, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp.242-248, 2008.
DOI : 10.1109/WIIAT.2008.20

K. M. Hall, An r-dimensional quadratic placement algorithm, Management Science, 1970.
DOI : 10.1287/mnsc.17.3.219

S. B. Handurukande, A. Kermarrec, F. Le-fessant, L. Massoulie, and S. Patarin, Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems, EuroSys, pp.359-371, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070501

M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and P. Weis, Resisting structural re-identification in anonymized social networks, PVLDB, vol.1, issue.1, pp.102-114, 2008.

A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme, Information Retrieval in Folksonomies: Search and Ranking, ESWC, pp.411-426, 2006.
DOI : 10.1007/11762256_31

R. Jäschke, L. Marinho, A. Hotho, L. Schmidt-thieme, and G. Stumme, Tag Recommendations in Folksonomies, PKDD, pp.506-514, 2007.
DOI : 10.1007/978-3-540-74976-9_52

M. Jelasity, S. Voulgaris, R. Guerraoui, A. Kermarrec, and M. Van-steen, Gossip-based peer sampling, ACM Transactions on Computer Systems, vol.25, issue.3, p.8, 2007.
DOI : 10.1145/1275517.1275520

H. Jie and Y. Zhang, Personalized faceted query expansion, SIGIR, 2006.

H. Jin, X. Ning, and H. Chen, Efficient search for peer-to-peer information retrieval using semantic small world, Proceedings of the 15th international conference on World Wide Web , WWW '06, pp.1003-1004, 2006.
DOI : 10.1145/1135777.1135986

D. Kempe and F. Mcsherry, A decentralized algorithm for spectral analysis, STOC, pp.561-568, 2004.

A. Kermarrec, Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE, Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS '09), pp.1-16, 2009.
DOI : 10.1007/978-3-642-05118-0_1
URL : https://hal.archives-ouvertes.fr/inria-00435170

M. Khambatti, K. D. Ryu, and P. Dasgupta, Structuring peer-to-peer networks using interestbased communities, DBISP2P, pp.48-63, 2003.

J. Kleinberg, The small-world phenomenon, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.163-170, 2000.
DOI : 10.1145/335305.335325

J. Kleinberg, Complex networks and decentralized search algorithms, In ICM, 2006.
DOI : 10.4171/022-3/50

Y. Koren, Drawing graphs by eigenvectors: theory and practice, Computers & Mathematics with Applications, vol.49, issue.11-12, pp.1867-1888, 2005.
DOI : 10.1016/j.camwa.2004.08.015

V. E. Krebs, Mapping networks of terrorist cells, Connections, vol.24, issue.3, pp.43-52, 2002.

S. Le-blond, J. Guillaume, and M. Latapy, Clustering in P2P Exchanges and Consequences on Performances, IPTPS, pp.193-204, 2005.
DOI : 10.1007/11558989_18
URL : https://hal.archives-ouvertes.fr/hal-00016820

V. Leroy, B. B. Cambazoglu, and F. Bonchi, Cold start link prediction, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.393-402, 2010.
DOI : 10.1145/1835804.1835855
URL : https://hal.archives-ouvertes.fr/inria-00485619

M. Li, A. Lee, W. , and J. Zhao, Ssw: A small-world-based overlay for peer-to-peer search, TPDS, vol.19, issue.6, pp.735-749, 2008.

D. Liben-nowell and J. Kleinberg, The link-prediction problem for social networks, ASIS&T, issue.7, p.58, 2007.

N. Linial, E. London, Y. J. Rabinovich61-]-m, G. Mcgill, and . Salton, The geometry of graphs and some of its algorithmic applications Introduction to modern information retrieval Exploiting social networks for internet search, HotNets, pp.577-591, 1986.

A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement , IMC '07, pp.29-42, 2007.
DOI : 10.1145/1298306.1298311

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

S. Niwa, T. Doi, and S. Honiden, Web page recommender system based on folksonomy mining for itng '06 submissions, ITNG, pp.388-393, 2006.

A. Noack, An Energy Model for Visual Graph Clustering, Graph Drawing, pp.425-436, 2003.
DOI : 10.1007/978-3-540-24595-7_40

A. Noack, Modularity clustering is force-directed layout, Physical Review E, vol.79, issue.2, 2009.
DOI : 10.1103/PhysRevE.79.026102

J. O. 'madadhain, J. Hutchins, and P. Smyth, Prediction and ranking algorithms for event-based network data, ACM SIGKDD Explorations Newsletter, vol.7, issue.2, pp.23-30, 2005.
DOI : 10.1145/1117454.1117458

G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.387, issue.7043, pp.435814-818, 2005.
DOI : 10.1038/nature03248

J. A. Patel, É. Rivière, I. Gupta, and A. Kermarrec, Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems, Computer Networks, vol.53, issue.13, pp.532304-2320, 2009.
DOI : 10.1016/j.comnet.2009.03.018
URL : https://hal.archives-ouvertes.fr/inria-00436057

M. Potamias, F. Bonchi, A. Gionis, and G. Kollios, k-nearest neighbors in uncertain graphs, Proceedings of the VLDB, the 36th International Conference on Very Large Databases, 2010.
DOI : 10.14778/1920841.1920967

F. J. Provost, T. Fawcett, and R. Kohavi, The case against accuracy estimation for comparing induction algorithms, ICML, 1998.

S. E. Robertson and S. Walker, Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval, Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '94), pp.345-354, 1994.
DOI : 10.1007/978-1-4471-2099-5_24

S. T. Roweis and L. K. Saul, Nonlinear Dimensionality Reduction by Locally Linear Embedding, Science, vol.290, issue.5500, p.2323, 2000.
DOI : 10.1126/science.290.5500.2323

J. Sedmidubsky, S. Barton, V. Dohnal, and P. Zezula, Adaptive Approximate Similarity Searching through Metric Social Networks, 2008 IEEE 24th International Conference on Data Engineering, pp.1424-1426, 2008.
DOI : 10.1109/ICDE.2008.4497577
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.7928

A. Singla and I. Weber, Camera brand congruence in the Flickr social graph, Proceedings of the Second ACM International Conference on Web Search and Data Mining, WSDM '09, pp.252-261, 2009.
DOI : 10.1145/1498759.1498834

K. Sripanidkulchai, B. Maggs, and H. Zhang, Efficient content location using interest-based locality in peer-to-peer systems, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.2166-2176, 2003.
DOI : 10.1109/INFCOM.2003.1209237

I. Stoica, R. Morris, D. Liben-nowell, D. R. Karger, M. F. Kaashoek et al., Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking, vol.11, issue.1, pp.17-32, 2003.
DOI : 10.1109/TNET.2002.808407

P. Syverson, G. Tsudik, M. Reed, and C. Landwehr, Towards an Analysis of Onion Routing Security, Proceedings of the International Workshop on Design Issues in Anonymity and Unobservability, pp.96-114, 2001.
DOI : 10.1007/3-540-44702-4_6

P. F. Syverson, D. M. Goldschlag, and M. G. Reed, Anonymous connections and onion routing, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.44-59, 1997.
DOI : 10.1109/SECPRI.1997.601314
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.3883

B. Taskar, M. F. Wong, P. Abbeel, and D. Koller, Link prediction in relational data, Neural Information Processing Systems, 2003.

W. M. Van-der-aalst, H. A. Reijers, and M. Song, Discovering Social Networks from Event Logs, Computer Supported Cooperative Work (CSCW), vol.2, issue.3, pp.549-593, 2005.
DOI : 10.1007/s10606-005-9005-9

F. Van-ham and J. J. Van-wijk, Interactive Visualization of Small World Graphs, IEEE Symposium on Information Visualization, pp.199-206, 2004.
DOI : 10.1109/INFVIS.2004.43

S. Voulgaris and M. Van-steen, Epidemic-style management of semantic overlays for contentbased searching, EuroPar, pp.1143-1152, 2005.

P. M. Winkler, Proof of the squashed cube conjecture, Combinatorica, vol.7, issue.4, pp.135-139, 1983.
DOI : 10.1007/BF02579350

B. Wong, A. Slivkins, and E. G. Sirer, Approximate matching for peer-to-peer overlays with cubit, 2008.

S. Xu, S. Bao, B. Fei, Z. Su, and Y. Yu, Exploring folksonomy for personalized search, Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '08, pp.155-162, 2008.
DOI : 10.1145/1390334.1390363

H. Yildirim and M. S. Krishnamoorthy, A random walk method for alleviating the sparsity problem in collaborative filtering, Proceedings of the 2008 ACM conference on Recommender systems, RecSys '08, pp.131-138, 2008.
DOI : 10.1145/1454008.1454031

H. Yu, M. Kaminsky, P. B. Gibbons, and A. D. Flaxman, Sybilguard: defending against sybil attacks via social networks, TON, vol.16, issue.3, pp.576-589, 2008.

B. Zadrozny and C. Elkan, Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers, Proceedings of the 18th International Conference on Machine Learning (ICML '01), pp.609-616, 2001.

B. Zadrozny and C. Elkan, Transforming classifier scores into accurate multiclass probability estimates, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.694-699, 2002.
DOI : 10.1145/775047.775151
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7457

V. Zanardi and L. Capra, Social ranking, Proceedings of the 2008 ACM conference on Recommender systems, RecSys '08, pp.51-58, 2008.
DOI : 10.1145/1454008.1454018

J. Zhang and Y. Yang, Probabilistic score estimation with piecewise logistic regression, Twenty-first international conference on Machine learning , ICML '04, p.115, 2004.
DOI : 10.1145/1015330.1015335

S. Zhao, N. Du, A. Nauerz, X. Zhang, Q. Yuan et al., Improved recommendation based on collaborative tagging behaviors, Proceedings of the 13th international conference on Intelligent user interfaces, IUI '08, pp.413-416, 2008.
DOI : 10.1145/1378773.1378843

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