. Par and . Dans, Arasu et al. citent bien le modèle du noeud papillon, et proposent une méthode de calcul de PageRank basée sur. . . l'écriture de A sous une forme triangulaire par blocs déduite de la décomposition en composantes fortement connexes (cf théorème 6) En particulier, utilisent le modèle du noeud papillon pour accélérer leur calcul de PageRank [ANTT01]. Vérifications faites

]. L. Ada99 and . Adamic, The small world web, Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries, pp.443-452

]. R. Springer-verlagajb99, H. Albert, A. Jeong, and . Barabasi, ISBN 3-540-66558-7 Cité page(s) 44 Diameter of the world wide web, Nature, vol.401, pp.149-130, 1999.

A. Arasu, J. Novak, A. Tomkins, and E. J. Tomlin, Pagerank computation and the structure of the web : Experiments and algorithms, p.143, 2001.

S. Abiteboul, M. Preda, G. Barabasi, and R. Albert, Adaptive on-line page importance computation Cité page(s) 26 Emergence of scaling in random networks, Proc. 12th International World Wide Web Conference, pp.280-290, 1999.

[. Bharat and A. Broder, A technique for measuring the relative size and overlap of public web search engines Cité page(s) 20, Proceedings of the seventh international conference on World Wide Web 7, pp.379-388, 1998.

T. Bennouas, M. Bouklit, F. De, and . Montgolfier, Un modèle gravitationnel du web In Actes de ALGOTEL03 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunication, 2003.

]. M. Ber00 and . Bergman, The deep web : Surfacing hidden value. White Papers) 19, p.39, 2000.

M. Bianchini, M. Gori, and E. F. Scarselli, Pagerank : A circuital analysis, pp.130-150, 2002.

M. Bianchini, M. Gori, and E. F. Scarselli, Inside pagerank Cité page(s) 79, In ACM Transactions on Internet Technology, vol.84, issue.140, pp.130-150, 2003.

M. Bouklit, A. Jean-, M. A. Broder, R. Kumar, F. Maghoul et al., Une analyse de pagerank, une mesure de popularité des pages web Cité page(s) 79 Graph structure in the web, Actes ALGOTEL'02 Proc. 9th International World Wide Web Conference, pp.150-309, 2000.

M. Bouklit and F. Mathieu, Effet de la touche back dans un modèle de surfeur aléatoire : application à pagerank, Journées Francophones de la Toile, pp.11-111, 2003.

T. Berners, L. Masinter, and M. M. Cahill, Rfc-1738 : Uniform ressource locators (url), p.45, 1994.

S. Brin, R. Motwani, L. Page, and T. Winograd, What can you do with a Web in your Pocket?, Data Engineering Bulletin, vol.21, issue.2, pp.37-47, 1998.

]. M. Bou01, . Bouklitbp98-]-s, L. Brin, and . Page, http://www.lirmm.fr/~bouklit/memoire.pdf Cité page(s) 79 The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems New Scientist, vol.150, issue.30, pp.1-7, 1997.

]. M. Bri02 and . Brinkmeier, Communities in graphs, p.45, 2002.

. Bv-]-p, S. Boldi, . Vigna-]-c, A. Cooper, and . Frieze, Projet webgraph. http://vigna.dsi.unimi.it/papers.php#BoVWFI Cité page(s) 109 Crawling on web graphs, Proceedings of the thiryfourth annual ACM symposium on Theory of computing, pp.419-427, 2002.

J. Cho, H. García-molina, and E. L. Page, Efficient crawling through URL orderings) 27 What do web users do? an empirical analysis of web use, Computer Networks and ISDN Systems International Journal of Human Computer Studies, vol.30, issue.83, pp.1-7, 1998.

]. T. Col, . D. Collins-]-l, J. E. Catledge, and . Pitkow, s) 159 Probabilities in the game of monopoly. http://www.tkcs-collins.com/truman/monopoly/monopoly.shtml Cité page(s) 66 Characterizing browsing strategies in the world wide web Cité page(s) 83 Google's pagerank explained, Computer Networks and ISDN Systems, vol.68, issue.92, pp.160-69, 1995.

S. [. Cohen and . Shenker, Replication strategies in unstructured peer-to-peer networks, The ACM SIGCOMM'02 Conference, 2002.

]. M. Dah00 and . Dahn, Counting angels on a pinhead : Critically interpreting web size estimates

S. Online, S. R. Dill, K. S. Kumar, S. Mccurley, D. Rajagopalan et al., Self-similarity in the web Cité page(s) 100, dahn1.html Cité page(s) 20, 26 [DKM + 01] The VLDB Journal, pp.35-40, 2000.

N. Eiron, K. S. Mccurley, J. A. Tomlinfce95-]-q, R. F. Feng, E. P. Cohen et al., Ranking the web frontier Cité page(s) 26 How to draw a planar clustered graph, Proc. 13th International World Wide Web Conference, pp.309-318, 1995.

]. R. Fgm-+-99, J. Fielding, J. Gettys, H. Mogul, L. Frystyk et al., Hypertext transfer protocol ? HTTP/1.1, 1999. citeseer.ist.psu.edu/fielding97hypertext.html Cité page(s) 22 Random walks with " back buttons, pp.25-484

S. [. Fessant and . Patarin, Mldonkey, a multi-network peer-to-peer file-sharing program, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071789

]. P. Gau96 and . Gaucher, Le monopoly pour les nuls, 1996.

J. Guillaume, M. Latapy, and E. F. Mathieu, Tout le web accessible en quelques clics, p.21, 2002.

J. Guillaume, M. Latapy, and E. L. Viennot, Efficient and Simple Encodings for the Web Graph, Proceedings of the 11-th international conference on the World Wide Web, 2002.
DOI : 10.1007/3-540-45703-8_30
URL : https://hal.archives-ouvertes.fr/inria-00471704

]. W. Gof71 and . Goffman, A mathematical method for analyzing the growth of a scientific discipline, J. ACM, vol.18, issue.2, pp.173-185, 1971.

]. Goo98 and . Google, Cité page(s) 79, pp.81-121, 1998.

M. R. Henzinger, A. Heydon, M. Mitzenmacher, M. N. Najork, M. Harvey et al., Measuring index quality using random walks on the Web Skipnet : A scalable overlay network with practical locality properties, Computer Networks, vol.31, issue.28, pp.11-16, 1999.

S. Kamvar, T. Haveliwala, C. Manning, G. Golubkhmg03b, ]. S. Kamvar et al., Exploiting the block structure of the web for computing pageranks) 36, 41 Extrapolation methods for accelerating pagerank computationss) 25 Experiments with pagerank computation, Proceedings of the Twelfth International World Wide Web Conference, pp.150-121, 2003.

]. J. Kle98, ]. J. Kleinbergkle99, and . Kleinberg, Authoritative Sources in a Hyperlinked Environment Cité page(s) 41 The small-world phenomenon : An algorithmic perspective, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.668-677, 1998.

J. Kangasharju, J. Roberts, and E. K. Ross, Object replication strategies in content distribution networks, Computer Communications, vol.25, issue.4, 2001.
DOI : 10.1016/S0140-3664(01)00409-1

C. [. Lawrence, . Giles-]-s, C. L. Lawrence, and . Giles, Searching the world wide web Cité page(s) 26 Accessibility of information on the web, Science Nature, vol.280, issue.39, pp.98-100, 1998.

W. Li, O. Kolak, Q. Vu, and E. H. Takano, Defining logical domains in a web site, Proceedings of the eleventh ACM on Hypertext and hypermedia , HYPERTEXT '00, pp.123-132
DOI : 10.1145/336296.336345

A. N. Langville, C. D. Meyer, . Deeper, . Rapport, . Ncsu-center-for-res et al., Cité page(s) 44, 48, 51 Cité page(s) 36, 79s) 11 The effect of the back button in a random walk : application for pagerank, Première journée Graphes Dynamiques et Graphes du Web Alternate track papers & posters of the 13th international conference on World Wide Web, pp.81-150, 2000.

N. Milic-frayling, R. Jones, K. Rodden, G. Smyth, A. Blackwell et al., Smartback, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.63-71, 2000.
DOI : 10.1145/988672.988682

L. [. Mathieu and . Viennot, Structure intrinsèque du web. Rapport Tech. RR-4663, p.145

F. Mathieu and L. Viennot, Aspects locaux de l'importance globale des pages web Cité page(s) 11, 5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications, p.145, 2003.

F. Mathieu, L. F. Viennot, L. Mathieu, and . Viennot, Local structure in the web http://www2003.org/cdrom/papers/poster/p102/p102-mathieu.htm Cité page(s) 11 Local aspects of the global ranking of web pages, pp.145-145, 2003.

B. Olb-+-02-]-e.-o-'neill, R. Lavoie, A. Bennett, E. S. Dyer, and . Worthington, Web characterization project, p.44, 2002.

L. Page, S. Brin, R. Motwani, and E. T. Winograd, The PageRank Citation Ranking : Bringing Order to the Web, pp.86-88, 1998.

A. R. Puniyani, R. M. Lukose, and B. A. Huberman, Intentional walks on scale free small worlds. Rapport tech, p.149, 2001.

P. S. Ratnasamy, M. Francis, R. Handley, E. S. Karp, and . Shenker, A scalable content addressable network, Proceedings of ACM SIGCOMM 2001

S. Raghavan and H. Garcia-molina, Representing web graphs, 2003.

K. Randall, R. Stata, R. Wickremesinghe, and E. J. Wiener, The Link Database: fast access to graphs of the Web, Proceedings DCC 2002. Data Compression Conference, 2001.
DOI : 10.1109/DCC.2002.999950

]. G. Sal89 and . Salton, Automatic text processing, Massachusetts, p.80, 1989.

. [. Saloff-coste-g, L. Giné, and . Saloff-coste, Lectures on finite Markov chains, Lecture Notes on Probability Theory and Statistics ? 1665 in LNM, pp.301-413, 1996.
DOI : 10.1103/PhysRevLett.58.86

. Sea and . Searchengineshowdown, Cité page(s) 29, p.38

S. Saroiu, P. K. Gummadi, and S. D. Gribble, A measurement study of peer-to-peer file sharing systemss) 170 [She88] O. B. SHEYNIN. A a. markov's work on probability, Proceedings of Multimedia Computing and ??? Networking, pp.337-377, 1988.

. Smk-+-01-]-i, R. Stoica, D. Morris, M. F. Karger, E. H. Kaashoek et al., Chord : A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 ACM SIGCOMM conference, pp.149-160, 2001.

. [. De and . Price, Little Science, Big Science, p.81, 1963.

G. [. Sherman and . Price, The Invisible Web : Uncovering Information Sources Search Engines Can't See, p.20, 2001.

]. W. Ste94 and . Stewart, Introduction to the Numerical Solution of Markov Chains, p.85, 1994.

]. I. Ste96 and . Stewart, Monopoly revisited, Scientific American, vol.175, pp.116-119, 1996.

]. D. Sul00 and . Sullivan, Invisible web gets deeper http://searchenginewatch.com/sereport/article.php/2162871 Cité page(s) 19 [Syd04] M. SYDOW. Random surfer with back step, Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pp.352-353, 2000.

]. L. Tauscher, S. A. Greenbergtom03-]-j, and . Tomlin, Cité page(s) 113 How people revisit web pages : empirical findings and implications for the design of history systems Cité page(s) 83 A new paradigm for ranking pages on the world wide web, Proceedings of the Twelfth International World Wide Web Conference, pp.114-97, 1997.

L. Wang and C. Meinel, Cité page(s) 43 Behaviour recovery and complicated pattern definition in web usage mining, ICWE, pp.531-544, 2004.

B. Yuwono, S. L. Lam, J. H. Ying, and D. L. Lee, A world wide web resource discovery system, Proc. 4th International World Wide Web Conference, p.80, 1995.

J. [. Zhao, A. D. Kubiatowicz, and . Joseph, Tapestry, ACM SIGCOMM Computer Communication Review, vol.32, issue.1
DOI : 10.1145/510726.510755