## Description

### Unformatted Attachment Preview

Purchase answer to see full attachment

## Explanation & Answer

View attached explanation and answer. Let me know if you have any questions.

Mathematical Methods of Data Theory

Student’s Name

Institution

1. a)

0

1

1

1

0

0

0

1

0

1

0

0

0

0

1

0

b)

A graph is irreducible if and only if it is a connected graph. This implies that for any two

vertices 1, 2, there exists a path whose endpoints are connected. The graph above is a

connected graph making the matrix irreducible.

c)

0

0

0

0

1

0

1

0

1

0

0

1

1

1

0

0

d)

procedure PageRank(G, iteration)

for all p in the graph do opg[p] 0 do

dp 𝑥1 = −10. This leads to the creation of two

points, (-10, 0) and (0, 10).

𝑥2 ≤ 𝑥1 + 10

G...