Homework Answers
Add Answer to:
3. Given the graph below and the PageRank algorithm, compute three power iterations.
Compute PageRank from the web graph image posted keeping in mind it features a series of...
Compute PageRank from the web graph image posted keeping in mind
it features a series of deadends. .
There is a single node with a self-loop, which is also the root
of a complete binary tree of n levels.
Suppose we recursively eliminate dead ends from the graph, solve
the remaining graph, estimating the PageRank for the dead-end
pages. What would be the Page- Rank assigned to each of the
nodes?
Figure 5.10: A tree of dead ends
(9) (Application: Google PageRank) Consider the graph Г below. 0 U3 04 02 (a) Just by...
(9) (Application: Google PageRank) Consider the graph Г below. 0 U3 04 02 (a) Just by looking at the graph, rank the nodes from most important to least important? Explain your reasoning in a complete sentence or two. (b) What is A, the incidence matrix of「 (c) By the Perron Frobenius Theorem, A has a unique largest eigenvalue. Use our iterative methods to approximate an eigenvector for the maximal eigenvalue. Use GeoGebra Give each entry of the eigenvector correct to...
Write an algorithm that estimates the desired eigenvalues of an input matrix by using the power...
Write an algorithm that estimates the desired eigenvalues of an input matrix by using the power method. Your algorithm must find the i^th largest eigenvalues by using the power method and deflation to remove an already determined dominant eigenvalues. Save your algorithm as "LastnamePM.m." Your algorithm must be a function of A (input matrix), n (the number of iterations), and i (the i^th largest eigenvalues). For example, if you call "LastnamePM(A, 10,3)", the outcome will be the estimated 3,d largest...
Python PageRank-Nibble Parallel PageRank-Nibble is described in in Section 3.3 of [1]. At a high level,...
Python PageRank-Nibble
Parallel PageRank-Nibble is described in in Section 3.3 of [1].
At a high level, the algorithm works as follows:
each node i in the graph gets two new quantities, p[i] and
r[i]. p values will indicate the PageRank score, and r
holds a "residual"
add 1 unit of "mass" to r[seed]
iteratively, for each node i with "enough residual" r[i]
transfer some proportion of the mass in residual r[i] to
PageRank value p[i]
distribute some proportion of the remaining...
Triangle is a complete graph on 3 vertices (see below) You are given a graph G, and you need to calculate the number of triangles contained in G. Develop an efficient (better than cubic) algorithm to...
Triangle is a complete graph on 3 vertices (see below) You are given a graph G, and you need to calculate the number of triangles contained in G. Develop an efficient (better than cubic) algorithm to solve this problem. What is its running time? Explain your answer
Triangle is a complete graph on 3 vertices (see below) You are given a graph G, and you need to calculate the number of triangles contained in G. Develop an efficient (better than...
3. Given the graph G shown, we find the shortest paths from node S using the...
3. Given the graph G shown, we find the shortest paths from node S using the Bellman-Ford algorithm. How many iterations does it take before the algorithm converges to the solution? 4 A 1 -2 10 S -9 E 1 10 -8 B 2
aul 8 For the weighted graph given below, use the algorithm diseeeed claes to End the...
aul 8 For the weighted graph given below, use the algorithm diseeeed claes to End the shortest peth froms s to x. Be sure to show all of your steps and to redrus the graph along with the indices an cundlidete shortest paths each time that the nodes are reinlexs 10 5 3 15 15 15 10 10
Given then following data points x(1) = (2, 8); x(2) = (2, 5); x(3) = (1, 2); x(4) = (5, 8) x(5) = (7, 3); x(6) = (6, 4); x(7) = (8, 4); x(8) = (4, 7) Compute 2 iterations of the K-Means algorithm by hand using the Forgy’s initialisation choosing x(3),
Given then following data pointsx(1) = (2, 8); x(2) = (2, 5); x(3) = (1, 2); x(4) = (5, 8)x(5) = (7, 3); x(6) = (6, 4); x(7) = (8, 4); x(8) = (4, 7)Compute 2 iterations of the K-Means algorithm by hand using the Forgy’s initialisation choosing x(3), x(4) and x(6). Calculate the loss function in each iteration.
3- The figure given below shows the one line diagram of a simple power system. Line impedançe is given in per unit...
3- The figure given below shows the one line diagram of a simple power system. Line impedançe is given in per unit on a 100 MVA base. a. Find the unknown bus voltage by using Newton Raphson method with one iteration. IE you need Ssum you can use San-100 MVA. (20 pts) b. If after several iterations the bus voltage converge to V09-j0.1 pu, determine the power loss in the line and the bus 1 real and reactive power. (15...
If you understand how the above recursive algorithm to compute yz works, you can turn it...
If you understand how the above recursive algorithm to compute yz works, you can turn it into a more efficient iterative algorithm that basically uses the same strategy (though it is not a tail recursive algorithm). Some parts of this iterative algorithm is given below. Fill in the blanks: Power-iterative(y: number; z: non-negative integer) 1. answer=1 2. while z > 0 3. if z is odd then answer=__________ 4. z = ________ 5. y = _________ 6....
Compute PageRank from the web graph image posted keeping in mind
it features a series of deadends. .
There is a single node with a self-loop, which is also the root
of a complete binary tree of n levels.
Suppose we recursively eliminate dead ends from the graph, solve
the remaining graph, estimating the PageRank for the dead-end
pages. What would be the Page- Rank assigned to each of the
nodes?
Figure 5.10: A tree of dead ends
(9) (Application: Google PageRank) Consider the graph Г below. 0 U3 04 02 (a) Just by looking at the graph, rank the nodes from most important to least important? Explain your reasoning in a complete sentence or two. (b) What is A, the incidence matrix of「 (c) By the Perron Frobenius Theorem, A has a unique largest eigenvalue. Use our iterative methods to approximate an eigenvector for the maximal eigenvalue. Use GeoGebra Give each entry of the eigenvector correct to...
Write an algorithm that estimates the desired eigenvalues of an input matrix by using the power method. Your algorithm must find the i^th largest eigenvalues by using the power method and deflation to remove an already determined dominant eigenvalues. Save your algorithm as "LastnamePM.m." Your algorithm must be a function of A (input matrix), n (the number of iterations), and i (the i^th largest eigenvalues). For example, if you call "LastnamePM(A, 10,3)", the outcome will be the estimated 3,d largest...
Python PageRank-Nibble
Parallel PageRank-Nibble is described in in Section 3.3 of [1].
At a high level, the algorithm works as follows:
each node i in the graph gets two new quantities, p[i] and
r[i]. p values will indicate the PageRank score, and r
holds a "residual"
add 1 unit of "mass" to r[seed]
iteratively, for each node i with "enough residual" r[i]
transfer some proportion of the mass in residual r[i] to
PageRank value p[i]
distribute some proportion of the remaining...
Triangle is a complete graph on 3 vertices (see below) You are given a graph G, and you need to calculate the number of triangles contained in G. Develop an efficient (better than cubic) algorithm to solve this problem. What is its running time? Explain your answer
Triangle is a complete graph on 3 vertices (see below) You are given a graph G, and you need to calculate the number of triangles contained in G. Develop an efficient (better than...
3. Given the graph G shown, we find the shortest paths from node S using the Bellman-Ford algorithm. How many iterations does it take before the algorithm converges to the solution? 4 A 1 -2 10 S -9 E 1 10 -8 B 2
aul 8 For the weighted graph given below, use the algorithm diseeeed claes to End the shortest peth froms s to x. Be sure to show all of your steps and to redrus the graph along with the indices an cundlidete shortest paths each time that the nodes are reinlexs 10 5 3 15 15 15 10 10
3- The figure given below shows the one line diagram of a simple power system. Line impedançe is given in per unit on a 100 MVA base. a. Find the unknown bus voltage by using Newton Raphson method with one iteration. IE you need Ssum you can use San-100 MVA. (20 pts) b. If after several iterations the bus voltage converge to V09-j0.1 pu, determine the power loss in the line and the bus 1 real and reactive power. (15...
Most questions answered within 3 hours.
-
For a reaction, reagents --->products, it's forwarding rate
(rate of products formation) is proportional to the...
asked 6 minutes ago -
5)
Typically,
there will need to be a rather high degree of coordination and
interaction among...
asked 2 minutes ago -
if the marginal revenue on each MRI is $2500, and the
marginal cost for each is...
asked 4 minutes ago -
The amounts of nicotine in a certain brand of cigarette are
normally distributed with a mean...
asked 8 minutes ago -
What did Butler and Hobbes contribute to our understanding of
utilitarianism?
asked 9 minutes ago -
History
Lincoln's religious thought was almost exclusively shaped by his
Calvinist upbringing.
True
False
QUESTION 6...
asked 8 minutes ago -
In a two-way factorial ANOVA, the final F-ratio for
factor AxB is determined by dividing _____...
asked 9 minutes ago -
If 1.6g of CH4 reacts with oxygen gas to form water and carbon
dioxide what is...
asked 8 minutes ago -
Applying the content from Primal Leadership, and the format
Personal Change Plan on p. 110 Boyatzis...
asked 10 minutes ago -
Your black labrador has a genotype of BbEe.
Which of the following is correct? Select all...
asked 14 minutes ago -
Which of the following statements explains why the cost of
advertising might be relevant to a...
asked 24 minutes ago -
NO3- nitrate ion, what is the symmetry operationof rotation of
it?
asked 29 minutes ago