L. Adamic, R. Lukose, A. Puniyani, and B. Huberman, Search in power-law networks, Physical Review E, vol.64, issue.4, pp.1-8, 2001.
DOI : 10.1103/PhysRevE.64.046135
URL : http://arxiv.org/abs/cs/0103016

A. Barabási and R. Albert, Emergence of scaling in random networks Mathematical results on scale-free random graphs, Handbook of graphs and networks, pp.509-512, 1999.

C. Cooper and A. M. Frieze, A general model of web graphs. Random Struct, Algorithms, vol.22, issue.3, pp.311-335, 2003.

P. Fraigniaud, P. Gauron, and M. Latapy, Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System, Euro-Par, pp.1163-1172, 2005.
DOI : 10.1007/11549468_127

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

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, vol.3, issue.2-3, pp.161-179, 1995.
DOI : 10.1002/rsa.3240060204

F. Tamás and . Móri, The maximum degree of the Barabási-Albert random tree, Combinatorics, Probability and Computing, vol.14, pp.339-348, 2005.

N. Sarshar, O. Boykin, and V. P. Roychowdhury, Percolation search in power law networks: making unstructured peer-to-peer networks scalable, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings., pp.2-9, 2004.
DOI : 10.1109/PTP.2004.1334925