Professional Documents
Culture Documents
AD Google PageRank
AD Google PageRank
Activitat 2
1
𝑮 = 𝛼𝑺 + (1 − 𝛼) 𝑱
𝑛
Activitat 3
0 0 0 0 0 0 1/3 0
1/2 0 1/2 1/3 0 0 0 0
⎛ ⎞
⎜1/2 0 0 0 0 0 0 0 ⎟
0 1 0 0 0 0 0 0 ⎟
𝑺=⎜
⎜ 0 0 1/2 1/3 0 0 1/3 0 ⎟
⎜ 0 0 0 1/3 1/3 0 0 1/2⎟
0 0 0 0 1/3 0 0 1/2
⎝ 0 0 0 0 1/3 1 1/3 0 ⎠
1
𝑮 = 𝛼𝑺 + (1 − 𝛼) 𝑱
𝑛
0 0 0 0 0 0 1/3 0 1 1 1 1 1 1 1 1
1/2 0 1/2 1/3 0 0 0 0 1 1 1 1 1 1 1 1
⎛ ⎞ ⎛ ⎞
⎜1/2 0 0 0 0 0 0 0 ⎟
⎜
1 1 1 1 1 1 1 1
⎟
0 1 0 0 0 0 0 0 ⎟ 1 1 1 1 1 1 1 1 1⎟
𝑮 = 0,85 ⎜ + (1 − 0,85) ⎜
⎜ 0 0 1/2 1/3 0 0 1/3 0 ⎟ 8 ⎜1 1 1 1 1 1 1 1⎟
⎜ 0 0 0 1/3 1/3 0 0 1/2⎟ ⎜1 1 1 1 1 1 1 1⎟
0 0 0 0 1/3 0 0 1/2 1 1 1 1 1 1 1 1
⎝ 0 0 0 0 1/3 1 1/3 0 ⎠ ⎝1 1 1 1 1 1 1 1⎠
import numpy
#Ens fa Iterations iteracions del mètode de la potència amb la matriu Matrix, començant pel vector
StartingVector
#i ens retorna una aproximació del vector propi que conté el valor propi més gran
CurrentVector = StartingVector
for i in range(Iterations):
# result = result/numpy.linalg.norm(result)
def MainActivity1():
print("Activity 1\n_________________")
[0 ,0 ,0 ,1/3 ,1/5 ],
[1/2 ,0 ,0 ,0 ,1/5 ],
StartingVector = numpy.array([1/5,1/5,1/5,1/5,1/5])
def MainActivity2():
print("Activity 2\n_________________")
StartingVector = numpy.array([1/5,1/5,1/5,1/5,1/5])
def MainActivity3():
print("Activity 3\n_________________")
StartingVector = numpy.array([1/8,1/8,1/8,1/8,1/8,1/8,1/8,1/8])
MainActivity1()
print("\n\n")
MainActivity2()
print("\n\n")
MainActivity3()
Output:
Activity 1
_________________
Activity 2
_________________
Activity 3
_________________
Vector propi a l'iteració 20 : [0.06309152 0.09252589 0.04556554 0.0973956 0.11005187 0.18410546 0.15650951
0.25075461]