F. Chung, Laplacians and the Cheeger Inequality for Directed Graphs, Annals of Combinatorics, vol.9, issue.1, pp.1-19, 2005.
DOI : 10.1007/s00026-005-0237-z

S. Dolev, E. N. Hoch, and R. Van-renesse, Self-stabilizing and Byzantine-Tolerant Overlay Network, OPODIS 2007, pp.343-357, 2007.
DOI : 10.1007/978-3-540-77096-1_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8694

S. Dolev and E. Schiller, Communication adaptive self-stabilizing group membership service, IEEE Transactions on Parallel and Distributed Systems, vol.14, issue.7, pp.709-720, 2003.
DOI : 10.1109/TPDS.2003.1214322
URL : http://www.cse.chalmers.se/~elad/reprints/c002.pdf

P. Erdös and A. Rényi, On random graphs, I, Publicationes Mathematicae (Debrecen), vol.6, pp.290-297, 1959.

T. I. Fenner and A. M. Frieze, On the connectivity of randomm-orientable graphs and digraphs, Combinatorica, vol.18, issue.4, pp.347-359, 1982.
DOI : 10.1007/BF02579431

J. Ayalvadi, A. Ganesh, L. Kermarrec, and . Massoulié, Peer-to-peer membership management for gossip-based protocols, IEEE Trans. Computers, vol.52, issue.2, pp.139-149, 2003.

A. Kermarrec, L. Massoulié, and A. J. Ganesh, Probabilistic reliable dissemination in large-scale systems, IEEE Transactions on Parallel and Distributed Systems, vol.14, issue.3, pp.248-258, 2003.
DOI : 10.1109/TPDS.2003.1189583

C. J. Mcdiarmid, General percolation and random graphs, Advances in Applied Probability, vol.11, issue.01, pp.40-60, 1982.
DOI : 10.4153/CJM-1960-049-6

I. T. Antony, P. Rowstron, and . Druschel, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Middleware '01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pp.329-350, 2001.

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