Analyzing the effect of introducing time as a component in Python dependency graphs

The use of open-source packages is a common practice among developers. It decreases the development time and improves maintainability. But adding a dependency to a project comes with inherit risks such as introducing vulnerabilities. A few solutions that help visualize all of the dependencies of a project exist already. However, none provide the...

Performance modeling of PageRank in large-scale systems: A case study

Graphs are a ubiquitous concept used for modeling entities and their relationships. Large graphs, present in a variety of domains, are often fundamentally difficult to process because of sheer size and irregular computation structure. In recent years, both academia and industry have committed to designing scalable solutions to efficiently...

The PageRank algorithm as a method to optimize swarm behavior through local analysis

This work proposes PageRank as a tool to evaluate and optimize the global performance of a swarm based on the analysis of the local behavior of a single robot. PageRank is a graph centrality measure that assesses the importance of nodes based on how likely they are to be reached when traversing a graph. We relate this, using a microscopic...

Implementing the Reordered PageRank Algorithm in Giraph

PageRank, a method to rank web pages objectively and mechanically, models a random web surfer. The PageRank problem is most easily solved iteratively, using the power method. In this paper the reordered PageRank algorithms are discussed. These algorithms (proposed by A. N. Langville and C. D. Meyer in "A reordering for the PageRank problem") see...

Accelerating Google PageRank by applying Aitken Extrapolation and Quadratic Extrapolation

Google PageRank is an algorithm incorporated by Google to rank websites, using the amount of links a website has as well as the importance of each link. This process can be calculated using the power method. As the amount of websites grows it is essential to speed up this process. Two extrapolation methods, Aitken Extrapolation and Quadratic...

The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming

Google uses the PageRank algorithm to determine the relative importance of a website. Link spamming is the name for putting links between websites with no other purpose than to increase the PageRank value of a website. To give a fair result to a search query it is important to detect whether a website is link spammed so that it can be filtered...

Google PageRank and Reduced-Order Modelling

Google PageRank is designed to determine the importance of a webpage. To do so, one needs to compute an eigenvector of the Google matrix. We show that this vector can also be found by solving a linear system. Additionally, an adjustment to the PageRank model will be made by considering one of the parameters to be a stochastic variable. We will...

Google's PageRank Algoritmes

The second eigenvector of the Google matrix and its relation to link spamming

Google PageRank attempts to return the best ranking of websites when searching on the web. To find this ranking, Google introduces a Markov matrix to model the behaviour of internet users. We find that using irreducible closed subsets is an effective way to unfairly increase the PageRank of a website (perform link spamming) and this can be...

Google's PageRank: De tweede eigenwaarde en een variable sprongkans

Google maakt gebruik van PageRank om webpagina's te rangschikken naar hoe belangrijk ze zijn. Het berekenen van de PageRank vereist lineaire algebra. Ook komt Markov theorie hier aan bod. Één van de parameters is een zekere alfa. Deze alfa wordt door velen constant gekozen. Ik heb in dit rapport onderzoek gedaan naar de gevolgen van het variabel...

Efficiente benadering van Google's PageRank

Google maakt gebruik van de PageRankmethode om een lijst van pagina's te maken van belangrijk naar onbelangrijk. Om deze lijst te krijgen uit een enorme grote matrix gebruiken ze de eigenvector die hoort bij de eigenwaarde 1, die deze matrix altijd heeft. Om deze eigenvector te bepalen wordt de Powermethode gebruikt. In dit verslag probeer ik...

The PageRank Problem

The thesis is the result of a bachelor research project about Google's PageRank. An analysis of the hyperlink structure of the World Wide Web is made and a model for web surfing studied. Based on this model, some standard methods to compute the PageRank of web pages is investigated. Special attention is given to computing PageRanks by using...