Questions tagged [pagerank]
6 questions
4
votes
1 answer
What are the conditions for a graph's adjacency matrix to not have a negative eigenvalue with magnitude>=1?
Say I have a (directed) graph $G$ with an adjacency matrix $A$. For the sake of the question, let's assume it's normalized column-wise (edge weights are normalized so the sum of out-edge weights per node is equal to 1).
I'd like to calculate the…
Itamar Mushkin
- 672
- 3
- 19
3
votes
0 answers
How to measure "cyclicity" of a directed weighted graph?
Say you have a weighted directed graph with (potentially) some cycles in it. You want to have some sort of a measure of how "cyclical" this graph is. The requirements are:
This measure C=0 on an acyclical graph
C=1 on a fully connected graph
C…
ampanmdagaba
- 178
- 7
2
votes
0 answers
In personalized page rank, should the page rank vector be initialized uniformly?
In (normal) page rank, the (initial) page rank vector is usually initialized to the uniform distribution.
Should I do the same for personalized page rank? I wonder if I should initialize the page rank vector to the personalized teleportation…
Renaud
- 330
- 4
- 12
1
vote
1 answer
How to decompose a random walk (array) into its Markov Chain transition matrix?
The algorithm, PageRank, receives a Markov Chain transition matrix (page links from one to another.) Either by random walk, or more efficiently, eigenvectors, the stationary distribution of the Markov Chain can be found, which conveniently ranks…
jbuddy_13
- 1,578
- 3
- 22
1
vote
1 answer
Explanation on Google’s PageRank is Webpages as Eigenvectors
Help understand what is the matrix A and the vector x discussed below.
Mathematics for Machine Learning Example 4.9
Google uses the eigenvector corresponding to the maximal eigenvalue of
a matrix A to determine the rank of a page for search. The…
mon
- 685
- 5
- 16
1
vote
1 answer
Difference between $2^{nd}$ order random walk and personalized pagerank
I've been recently working with graph sampling, and I can't seem to find useful explanation of the following two aspects. On one side there are pagerank-based algorithms, which converge to a stationary distribution, and are extremely useful for…
sdgaw erzswer
- 1,199
- 1
- 9
- 13