So I\'m hoping to improve on my quiz score. What is the inital rank vector that

Question

So I'm hoping to improve on my quiz score.

What is the inital rank vector that should be used in the power interation method to guarantee convergence

A) A vector with all values equal to 1

B) A vector with any values that sum to 1 ( My choice and I think it's correct)

C) A vector with all values set to the number of out links for each node

D) A vector with all zero values

For PageRank to be computed, the stochastic adjacenty matrix could be stored on the disk, but the rank vector has to be stored in main memory

True ( my choice)

False (but i think it's this one)

A sparse matrix representation is more memory efficient

True ( my choice)

False

According to the PageRank Model, a page with more in links will always have a higher rank than a page with less in-links

True (my choice andi think it's correct)

False

What is the value of x that would make the following adjaceny matrix stochastic

1/4 1/3 0

1/2 1/3 0

x      1/3   0

A)1/3

B)1/2

C)0 (my choice, guessing need to know how to solve it)

D)1/4

Explain Answer

Explanation / Answer

According to myresearchi got that a vector with all values equal to 1 that should be used in the power interation method to guarantee convergence.

This statement is False it never says that for PageRank to be computed, the stochastic adjacenty matrix could be stored on the disk, but the rank vector has to be stored in main memory.

Yes it is true.
A sparse matrix is a two dimensional which contains many (often mostly) zero entries.

Yes it is true.
According to the PageRank Model, a page with more in links will always have a higher rank than a page with less in-links.

Thank you I am very sorry that I cannot provide you the last answer.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.