Skip to main content

Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 700))

Abstract

We analyze the cluster structure in large networks by means of clusters of exceedances regarding the influence characteristics of nodes. As the latter characteristics we use PageRank and the Max-Linear model and compare their distributions and dependence structure. Due to the heaviness of tail and dependence of PageRank and Max-Linear model observations, the influence indices appear by clusters or conglomerates of nodes grouped around influential nodes. The mean size of such clusters is determined by a so called extremal index. It is related to the tail index that indicates the heaviness of the distribution tail. We consider graphs of Web pages and partition them into clusters of nodes by their influence.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Beirlant, J., Goegebeur, Y., Teugels, J., Segers, J.: Statistics of Extremes: Theory and Applications. Wiley, Chichester (2004)

    Book  MATH  Google Scholar 

  2. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30(1), 107–117 (1998)

    Article  Google Scholar 

  3. Chen, N., Litvak, N., Olvera-Cravioto, M.: PageRank in scale-free random graphs. In: Bonato, A., Graham, F.C., Prałat, P. (eds.) WAW 2014. LNCS, vol. 8882, pp. 120–131. Springer, Cham (2014). doi:10.1007/978-3-319-13123-8_10

    Google Scholar 

  4. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  5. Gissibl, N., Klüppelberg, C.: Max-Linear models on directed acyclic graphs. arXiv:1512.07522v1, pp. 1–33 (2015)

  6. Hall, P.: Using the bootstrap to estimate mean squared error and select smoothing parameter in nonparametric problems. J. Multivar. Anal. 32, 177–203 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hill, B.M.: A simple general approach to inference about the tail of a distribution. Ann. Stat. 3, 1163–1174 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jelenkovic, P.R., Olvera-Cravioto, M.: Information ranking and power laws on trees. Adv. Appl. Probab. 42(4), 1057–1093 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Leadbetter, M.R.: Probability theory and related fields. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 65(2), 291–306 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. eprint arxiv:0810.1355 (2008)

  11. Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection (2014). http://snap.stanford.edu/data

  12. Markovich, N.M.: Nonparametric Analysis of Univariate Heavy-Tailed Data. Wiley, Chichester (2007)

    Book  MATH  Google Scholar 

  13. Markovich, N.M.: Clustering and hitting times of threshold exceedances and applications. Int. J. Data Anal. Tech. Strat. 1–18 (2017, to appear)

    Google Scholar 

  14. Markovich, N.M.: Extremes in random graphs models of complex networks. arXiv:1704.01302v1, 5 April 2017 (2017)

  15. Markovich, N.M.: Analysis of clusters in network graphs for personalized web search. In: IFAC 2017 World Congress, Toulouse, France, 7–14 July 2017 (2017, to appear)

    Google Scholar 

  16. McElroy, T., Politis, D.N.: Moment-based tail index estimation. J. Statist. Plan. Infer. 137(4), 1389–1406 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Volkovich, Y., Litvak, N.: On the exceedance point process for a stationary sequence. Adv. Appl. Probab. 42(2), 577–604 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Udo R. Krieger .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Markovich, N.M., Ryzhov, M., Krieger, U.R. (2017). Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model. In: Vishnevskiy, V., Samouylov, K., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2017. Communications in Computer and Information Science, vol 700. Springer, Cham. https://doi.org/10.1007/978-3-319-66836-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66836-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66835-2

  • Online ISBN: 978-3-319-66836-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics