Contents of this page:
Yana Volkovich obtained her Specialist Degree (with honors) in Mathematics and Computer Science at Saint Petersburg State University in June 2004y. Her thesis is entitled Adaptive optimization for M/G/1 queue, supervised by Oleg Granichin. In February 2005 she became a PhD student under the supervision of Nelly Litvak and Richard Boucherie at the Stochastic Operation Research group at the department of Electrical Engineering, Applied Mathematics and Computer Science at the University of Twente. In 2008 she became a Google Europe Anita Borg finalist. In November 2008 she was visiting Yahoo! Research Barcelona. In 2009, she finished her Ph.D. thesis on 'Stochastic analysis of web page ranking'
Today, the study of the World Wide Web is one of the most challenging subjects. In this work we
consider the Web from a probabilistic point of view. We analyze the relations between various
characteristics of the Web. In particular, we are interested in the Web properties that affect
the Web page ranking, which is a measure of popularity and importance of a page in the Web.
Mainly we restrict our attention on two widely-used algorithms for ranking: the number of references
on a page (indegree), and Googles PageRank. For the majority of self-organizing networks, such as
the Web and the Wikipedia, the in-degree and the PageRank are observed to follow power laws. In
this thesis we present a new methodology for analyzing the probabilistic behavior of the PageRank
distribution and the dependence between various power law parameters of the Web. Our approach is
based on the techniques from the theory of regular variations and the extreme value theory.
To download the thesis, which I finished in 2009, press: thesis.