N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, Proceedings of the twentyeighth annual ACM symposium on Theory of computing (STOC), pp.20-29, 1996.

E. Anceaume, Y. Busnel, and S. Gambs, Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes, Proceedings of the 14th International Conference On Principles Of Distributed Systems (OPODIS), pp.64-78, 2010.
DOI : 10.1007/11561071_71
URL : https://hal.archives-ouvertes.fr/hal-00554219

Z. Bar-yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan, Counting Distinct Elements in a Data Stream, Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM), pp.1-10, 2002.
DOI : 10.1007/3-540-45726-7_1

B. Bollobás, Random Graphs ? 2nd Edition, 2001.

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.2340-2359, 2009.
DOI : 10.1145/1400751.1400772

A. Chakrabarti, G. Cormode, and A. Mcgregor, A near-optimal algorithm for computing the entropy of a stream, ACM-SIAM Symposium on Discrete Algorithms, pp.328-335, 2007.

M. Charikar, K. Chen, and M. Farach-colton, Finding frequent items in data streams, Theoretical Computer Science, vol.312, issue.1, pp.3-15, 2004.
DOI : 10.1016/S0304-3975(03)00400-6

G. Cormode and S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications, Journal of Algorithms, vol.55, issue.1, pp.58-75, 2005.
DOI : 10.1016/j.jalgor.2003.12.001

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database mangement, Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), 1987.

J. Douceur and J. S. Donath, The Sybil Attack, Proceedings of the 1rst International Workshop on Peer-to-Peer Systems (IPTPS), pp.251-260, 2002.
DOI : 10.1007/3-540-45748-8_24

P. Flajolet and G. N. Martin, Probabilistic counting algorithms for data base applications, Journal of Computer and System Sciences, vol.31, issue.2, pp.182-209, 1985.
DOI : 10.1016/0022-0000(85)90041-8
URL : https://hal.archives-ouvertes.fr/inria-00076244

P. B. Godfrey, S. Shenker, and I. Stoica, Minimizing churn in distributed systems, Proceedings of the ACM SIGCOMM, 2006.
DOI : 10.1145/1151659.1159931
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.8082

G. P. Jesi, A. Montresor, and M. Van-steen, Secure peer sampling, Computer Networks, vol.54, issue.12, pp.2086-2098, 2010.
DOI : 10.1016/j.comnet.2010.03.020

D. M. Kane, J. Nelson, and D. P. Woodruff, An optimal algorithm for the distinct elements problem, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS '10, 2010.
DOI : 10.1145/1807085.1807094

J. G. Keneny and J. L. Snell, Finite Markov Chains, 1976.

S. Kullback and R. A. Leibler, On Information and Sufficiency, The Annals of Mathematical Statistics, vol.22, issue.1, pp.79-86, 1951.
DOI : 10.1214/aoms/1177729694

A. Lall, V. Sekar, M. Ogihara, J. Xu, and H. Zhang, Data streaming algorithms for estimating entropy of network traffic, Proceedings of the joint international conference on Measurement and modeling of computer systems (SIGMETRICS, 2006.

D. Liu, P. Ning, and W. Du, Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks, Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS), 2005.

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and Replication in Unstructured Peer-to-Peer Networks, Proceedings of the International Conference on Supercomputing (ICS), pp.84-95, 2002.

N. Lynch, Distributed Algorithms, 1996.

L. Massoulié, E. L. Merrer, A. Kermarrec, and A. Ganesh, Peer counting and sampling in overlay networks, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.123-132, 2006.
DOI : 10.1145/1146381.1146402

. Muthukrishnan, Data Streams: Algorithms and Applications, Foundations and Trends?? in Theoretical Computer Science, vol.1, issue.2, 2005.
DOI : 10.1561/0400000002

G. Rubino and B. Sericola, On weak lumpability in Markov chains, Journal of Applied Probability, vol.26, 1989.
URL : https://hal.archives-ouvertes.fr/inria-00075764

A. Singh, T. Ngan, P. Druschel, and D. S. Wallach, Eclipse Attacks on Overlay Networks: Threats and Defenses, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006.
DOI : 10.1109/INFOCOM.2006.231

D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, On Unbiased Sampling for Unstructured Peer-to-Peer Networks, IEEE/ACM Transactions on Networking, vol.17, issue.2, pp.377-390, 2009.
DOI : 10.1109/TNET.2008.2001730