# Questions tagged [pagerank]

The tag has no usage guidance.

6 questions
Filter by
Sorted by
Tagged with
1 vote
30 views

### 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 ...
• 1,634
1 vote
84 views

### 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 ...
• 775
166 views

### 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 ...
158 views

### 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 ...
• 178
1 vote
113 views

### 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 ...
• 1,229