title: Does igraph (python) implementation of PageRank include self-loops?
body: <p>I work on igraph on python with a weighted directed network with several self-loops. I have computed the pagerank of the nodes with igraph considering their respective weights  and directed = True. 
  In the literature I found the computation of PageRank takes into account the outdegree of nodes for its "random walk" (<a href="http://www.math.ryerson.ca/~abonato/webgraph.html" rel="nofollow noreferrer">http://www.math.ryerson.ca/~abonato/webgraph.html</a>), however it does not explicitly say what is done with self-loops. </p>
  
  <p>Am I right in assuming igraph considers self-loops in the computation of PageRank?</p>