Chapter 5 Perron Frobenius Theorem Flashcards

1
Q

What is the adjacency matrix

A

0, 1 matrix

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the H matrix

A

Obtained by normalising the rows of the adjacency matrix and so is non negative with sums of 1 on rows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

State the perron frobenius theorem

A

A is n x n with all entries non negative then:

  1. A had real eigenvlaue p, p>=|lamda| for every eigenvalue of A
  2. There is eigenvector v with non negative entries and row eigenvector W ^transpose corresponding the the eigenvalue p
  3. If A had positive entries P is simple. furthermore p>|lamda| for all eigenvalues lamda not qual to p of A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Why do we have the perron frobenius theorem

A

For really big matrices we cannot necessarily find the jordan blocks or eigenvalues to tell me about the limit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What does a simple eigenvalue mean

A

It is not repeated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

If A is positive then how is p simple?

A

As eigenvalue of A and vectors v and w have positive entries

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the name given to eigenvalue p in this theorem

A

perron eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the name given to the nonnegative eigenvector v

A

Perron eigenvector

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a key thing to remember when finding the left and right perron eigenvectors

A

They are positive typically so we should choose their values accordingly. Can be non negative if A is also non negative.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a stochastic matrix

A

An n x n matrix is stochastic if all entries are non negative and each row sum is 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How does the perron frobenius theorem relate to stochastic matrix

A

Then 1 is the perron eigenvalue of S and e = (1,1,1….1) is the corresponding perron eigenvector and we have |lamda|<=1 for all other eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does column stochastic mean

A

Matrix A is column stochastic if all entries are non negative and each column sum of A is 1. 1 is a left perron eigenvector of a column stochastic A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is doubly stochastic matrix

A

Non negative matrix that is both stochastic and column stochastic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What does perron frobenius tell us about a stochastic matrix with all positive entries

A

Perron eigenvalue is 1 and all other eigenvalues are less than 1. It has right eigenvector e= (1,1,1,…,1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

When does the limit exist for a stochastic matrix

A

Only when it is positive as then only 1 eigenvalue is equal to 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the purpose of the google matrix in finding the page rank

A

Matrix H is used in the page rank calculation but it doesnt necessarily have all positive entries so limit may not exist. It is replaced with modified G matrix which is stochastic with all positive entries.