title: What is PageRanks Big-O complexity?
body: <p>I'm searching for the Big-O complexity of PageRank algorithm.
  I hardly could found anything, I just found <code>O(n+m)</code> ( <code>n</code> - number of nodes, <code>m</code> - number of arcs/edges) but I didn't believe this complexity by now.</p>
  
  <p>I think it is missing the convergence criteria. I didn't think that this is a constant, I think the convergence depends on the graph diameter. It might be enough to have the Big-O for one iteration, then convergence is not important.</p>
  
  <p>Nevertheless PageRank need to touch every node and aggregate every incoming rank, so I expected a runtime of <code>O(n * m)</code>.</p>
  
  <p>Did I miss something? Did anyone know a valuable source for the Big-O complexity of PageRank?</p>
  
  <p>Thanks in advance.</p>