Pagerank algorithm for ranking a collection of inter-linked web pages in Python

The entries of that set look like the following edges={(0,1),(1,1),(1,2),(2,0),(2,2),(2,3),(3,3),(3,4),(4,6),(5,5),(5,6),(6,6),(6,3)}

How would I implement the following?

To create a function called randomwalk that takes as input the set edges, a teleport probability a and a positive integer iters and performs the random walk. Starting from any page, the function should randomly follow links from one page to the next, teleporting to a completely random page with probability a at each iteration.

This is my implementation so far however I need some help with completing the function stated above

import numpy as np
import random 

   def randomwalk(iters, a):
edges= np.matrix([[0,1], [1,1], [2,0] [2,2], [2,3], [3,3], [3,4], [4,6], [5,5], [6,6], [6,3]])
    s = edges.size
      random.choice(edges)