Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [page-rank]

For questions about Google PageRank algorithm and other similar algorithms.

0
votes
0answers
33 views

Computing PageRank Vector

I have been given the adjacency matrix $$A = \begin{pmatrix} 0 & 1 & 0&1&1 \\ 1 & 0 &1&1& 0\\ 0& 1 &0&0&1 \\1&1&0&0&1 \\0&1&1&...
0
votes
0answers
23 views

Transition Matrix in PageRank Algorithm

Problem Many sources claim that the transition matrix $\mathbf{P}$ ($\mathbf{P}_{ij}$ stands for the probability of jumping from page $i$ to page $j$) has special structure that it could be written ...
0
votes
0answers
17 views

Show that the vector of ones, e, is an eigenvector of the Google matrix transpose

In the Google matrix where $$G=\alpha A+(1-\alpha)\frac{1}{n}ee^T$$ and $e$ is a vector of ones, how do I show that $e$ is the eigenvector of $G^T$ corresponding to the eigenvalue of 1 I need to ...
0
votes
1answer
24 views

Show that columns of PageRank matrix sum to 1

Where the matrix A is replaced with $$G=\alpha A+(1-\alpha)\frac{1}{n}ee^T$$ Is it a sufficient condition a matrix is stochastic if the largest eigenvalue is 1? Or that in this case since A is ...
0
votes
0answers
33 views

Pagerank indegree relation derived process

I read paper which derive the relation between indegree and pagerank. But I was confused about some steps. I confused the $NP(\mathbf{k})$ part which marked by Question in steps below. Notation and ...
0
votes
0answers
20 views

How to calculate weights for pages without Inlinks or Outlinks in WEIGHTED PageRank?

I am trying to implement a variant of PageRank proposed by Wenpu Xing and Ali Ghorbani (see page 4 in the below link) in Matlab. In this variant, the weights require each page to have inlinks from a ...
1
vote
1answer
55 views

Calculating PageRank of a Google Matrix

Let $A$ the adjacency matrix of a Web Digraph, with $\{0,1\}$ entries. For sake of clarity, we assume that the matrix is irreducible and without full-zero rows (i.e. no leaf nodes in the graph) . ...
0
votes
1answer
74 views

Perron Frobenius Theorem modified

On this site I found a modified version of Perron Frobenius Theorem Perron-Frobenius Theorem: If M is a positive, column stochastic matrix, then: 1 is an eigenvalue of multiplicity one. 1 is ...
1
vote
0answers
97 views

Connections between the randomness of the normal distribution and Textrank?

In a TED speech on 8:40 the mathematician said that: This algorithm uses the laws of mathematical randomness to determine automatically the most relevant web pages, in the same way as we used ...
1
vote
0answers
16 views

What is the relationship between the fluid in PageRank and web traffic?

PageRank can be interpreted as the amount of an imaginary fluid that collects at different nodes in a web graph. I would like to know what the relationship is between this imaginary fluid and actual ...
3
votes
1answer
32 views

Ranking participants based on tiers and totals

I am trying to rank participants based on sets of data that I have. The data used is for a competition. In this competition, you can participate in X amount of events, at the end of the event you ...
2
votes
1answer
220 views

Prove that the dimension of the eigenspace corresponding to the eigenvalue $\lambda=1$ of $H$ is at least the number of the clusters..

There are lots of ’islands’ in the world-wide-web, meaning clusters of websites that are not connected to other parts of the world wide web via hyperlinks. Let $H$ denote the column stochastic ...
0
votes
1answer
192 views

Initial distribution of a Markov Chain (Power Model)

So, I was trying to model the PageRank algorithm based on the information of an article, and it said that in order to implement the power method, I needed the distribution of the process given by $$\...
1
vote
0answers
31 views

Calculate PageRank for small web

Calculate PageRank for: A links to B, B links to C and C links to B and C where the damping factor $\beta=0.8$ I have: $M=\begin{bmatrix} 0&0&\frac{1}{2} \\ 1&0&\frac{1}{2} \\ 0&...
2
votes
1answer
78 views

PageRank algorithm for grid graph

I am currently studying the PageRank algorithm. To find the ranks i know you have two options: Compute the result of a large linear system Apply the surfer concept (like Markov chains) I have this ...
4
votes
1answer
108 views

Why is the matrix $(I - A)$ theoretically singular?

I've the following Matlab code to compute the eigenvector using the inverse iteration (or power) method: A = p * G * D + delta; x = (I − A) \ e; x = x / sum(x); ...
2
votes
1answer
530 views

Understanding PageRank as an eigenvalue problem

In the book "A first course in numerical methods" by U. Arscher and C. Greif, chapter 8 on "Eingenvalues and singular values", example 8.1, we have: Given a network linkage graph with $n$ nodes (...
1
vote
1answer
175 views

Rewriting the simplified google algorithm in linear algebra form

I have the expression for the rank ($x_{i}$) of a page $i$ in an internet with $n$ sites, each site contains $n_{i}$ links to other sites and is linked to by the pages $L_{i}\subset\{1,\dots,n\}$. The ...