Skip to main content

2016 | OriginalPaper | Buchkapitel

Models of Random Graphs and Their Applications to the Web-Graph Analysis

verfasst von : Andrei Raigorodskii

Erschienen in: Information Retrieval

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This course provides an overview of various models for random graphs and their applications to the Web graph. We start with the classical Erdős-Rényi model, then proceed with the most recent models describing the topology and growth of the Internet, social networks, economic network, and biological networks, and finally present several applications of these models to the problems of search and crawling.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
The paper submitted to Internet Mathematics.
 
2
Submitted to Izvestia Mathematics.
 
3
Accepted to WAW.
 
Literatur
2.
Zurück zum Zitat Barabási, A., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Phys. A: Stat. Mech. Appl. 281(1–4), 69–77 (2000)CrossRef Barabási, A., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Phys. A: Stat. Mech. Appl. 281(1–4), 69–77 (2000)CrossRef
3.
Zurück zum Zitat Albert, R., Jeong, H., Barabási, A.L.: The diameter of the world wide web. Nature 401, 130–131 (1999)CrossRef Albert, R., Jeong, H., Barabási, A.L.: The diameter of the world wide web. Nature 401, 130–131 (1999)CrossRef
4.
Zurück zum Zitat Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)CrossRef Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)CrossRef
5.
Zurück zum Zitat Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 409–410 (1998)CrossRef Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 409–410 (1998)CrossRef
7.
Zurück zum Zitat Erdős, P., Rényi, A.: On random graphs, I. Publ. Math. (Debr.) 6, 290–297 (1959)MATH Erdős, P., Rényi, A.: On random graphs, I. Publ. Math. (Debr.) 6, 290–297 (1959)MATH
8.
Zurück zum Zitat Erdős, P., Rényi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17–61 (1960) Erdős, P., Rényi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17–61 (1960)
9.
11.
12.
Zurück zum Zitat Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.E.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279–290 (2001)MathSciNetCrossRefMATH Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.E.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279–290 (2001)MathSciNetCrossRefMATH
13.
Zurück zum Zitat Ostroumova Prokhorenkova, L., Samosvat, E.: Global clustering coefficient in scale-free networks. In: Bonato, A., Graham, F.C., Prałat, P. (eds.) WAW 2014. LNCS, vol. 8882, pp. 47–58. Springer, Heidelberg (2014) Ostroumova Prokhorenkova, L., Samosvat, E.: Global clustering coefficient in scale-free networks. In: Bonato, A., Graham, F.C., Prałat, P. (eds.) WAW 2014. LNCS, vol. 8882, pp. 47–58. Springer, Heidelberg (2014)
14.
Zurück zum Zitat Bollobás, B.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, Wiley, pp. 1–37 (2003) Bollobás, B.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, Wiley, pp. 1–37 (2003)
15.
Zurück zum Zitat Ryabchenko, A., Samosvat, E.: On the number of subgraphs of the Barabási-Albert random graph. Izv. Math. 76(3), 607–625 (2012)MathSciNetCrossRefMATH Ryabchenko, A., Samosvat, E.: On the number of subgraphs of the Barabási-Albert random graph. Izv. Math. 76(3), 607–625 (2012)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks with preferential linking. Phys. Rev. Lett. 85, 4633–4636 (2000)CrossRef Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks with preferential linking. Phys. Rev. Lett. 85, 4633–4636 (2000)CrossRef
17.
Zurück zum Zitat Buckley, P.G., Osthus, D.: Popularity based random graph models leading to a scale-free degree sequence. Discret. Math. 282(13), 53–68 (2004)MathSciNetCrossRefMATH Buckley, P.G., Osthus, D.: Popularity based random graph models leading to a scale-free degree sequence. Discret. Math. 282(13), 53–68 (2004)MathSciNetCrossRefMATH
18.
Zurück zum Zitat Kupavskii, A., Ostroumova, L., Shabanov, D., Tetali, P.: The distribution of second degrees in the Buckley–Osthus random graph model. Internet Math. 9(4), 297–335 (2013)MathSciNetCrossRefMATH Kupavskii, A., Ostroumova, L., Shabanov, D., Tetali, P.: The distribution of second degrees in the Buckley–Osthus random graph model. Internet Math. 9(4), 297–335 (2013)MathSciNetCrossRefMATH
19.
Zurück zum Zitat Grechnikov, E.: An estimate for the number of edges between vertices of given degrees in random graphs in the bollobás-riordan model. Moscow J. Comb. Number Theory 1(2), 40–73 (2011)MathSciNet Grechnikov, E.: An estimate for the number of edges between vertices of given degrees in random graphs in the bollobás-riordan model. Moscow J. Comb. Number Theory 1(2), 40–73 (2011)MathSciNet
20.
Zurück zum Zitat Zhukovskiy, M., Vinogradov, D., Pritykin, Y., Ostroumova, L., Grechnikov, E., Gusev, G., Serdyukov, P., Raigorodskii, A.: Empirical validation of the Buckley-Osthus model for the web host graph: degree and edge distributions. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, New York, NY, USA, pp. 1577–1581. ACM (2012) Zhukovskiy, M., Vinogradov, D., Pritykin, Y., Ostroumova, L., Grechnikov, E., Gusev, G., Serdyukov, P., Raigorodskii, A.: Empirical validation of the Buckley-Osthus model for the web host graph: degree and edge distributions. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, New York, NY, USA, pp. 1577–1581. ACM (2012)
21.
Zurück zum Zitat Eggemann, N., Noble, S.: The clustering coefficient of a scale-free random graph. Discret. Appl. Math. 159(10), 953–965 (2011)MathSciNetCrossRefMATH Eggemann, N., Noble, S.: The clustering coefficient of a scale-free random graph. Discret. Appl. Math. 159(10), 953–965 (2011)MathSciNetCrossRefMATH
23.
Zurück zum Zitat Bogolubsky, L., Dvurechensky, P., Gasnikov, A., Gusev, G., Nesterov, Y., Raigorodskii, A., Tikhonov, A., Zhukovskii, M.: Learning supervised PageRank with gradient-free optimization methods, p. 11, November 2014 Bogolubsky, L., Dvurechensky, P., Gasnikov, A., Gusev, G., Nesterov, Y., Raigorodskii, A., Tikhonov, A., Zhukovskii, M.: Learning supervised PageRank with gradient-free optimization methods, p. 11, November 2014
24.
Zurück zum Zitat Ostroumova, L., Ryabchenko, A., Samosvat, E.: Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 185–202. Springer, Heidelberg (2013)CrossRef Ostroumova, L., Ryabchenko, A., Samosvat, E.: Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 185–202. Springer, Heidelberg (2013)CrossRef
25.
Zurück zum Zitat Krot, A., Prokhorenkova, L.O.: Local clustering coefficient in generalized preferential attachment models, July 2015 Krot, A., Prokhorenkova, L.O.: Local clustering coefficient in generalized preferential attachment models, July 2015
26.
Zurück zum Zitat Ostroumova, L., Samosvat, E.: Recency-based preferential attachment models, June 2014 Ostroumova, L., Samosvat, E.: Recency-based preferential attachment models, June 2014
27.
Zurück zum Zitat Bollobás, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, Philadelphia, PA, USA, pp. 132–139. Society for Industrial and Applied Mathematics (2003) Bollobás, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, Philadelphia, PA, USA, pp. 132–139. Society for Industrial and Applied Mathematics (2003)
28.
Zurück zum Zitat Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 57–65 (2000) Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 57–65 (2000)
29.
Zurück zum Zitat Goyal, S.: Connections: An Introduction to the Economics of Networks. Princeton University Press, Princeton (2007)MATH Goyal, S.: Connections: An Introduction to the Economics of Networks. Princeton University Press, Princeton (2007)MATH
30.
31.
Zurück zum Zitat Newman, M., Barabási, A.L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton Studies in Complexity. Princeton University Press, Princeton (2006)MATH Newman, M., Barabási, A.L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton Studies in Complexity. Princeton University Press, Princeton (2006)MATH
32.
Zurück zum Zitat Dorogovtsev, S.: Lectures on Complex Networks. Oxford University Press Inc., New York (2010)CrossRefMATH Dorogovtsev, S.: Lectures on Complex Networks. Oxford University Press Inc., New York (2010)CrossRefMATH
33.
Zurück zum Zitat Durrett, R.: Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, New York (2006)CrossRefMATH Durrett, R.: Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, New York (2006)CrossRefMATH
Metadaten
Titel
Models of Random Graphs and Their Applications to the Web-Graph Analysis
verfasst von
Andrei Raigorodskii
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-41718-9_5

Neuer Inhalt