title: Computing a pagerank on a weighted graph with absolute weights
body: <p>I am facing the same issue as expressed in this link (<a href="https://stackoverflow.com/questions/15962324/networkx-pagerank-equal-ranks-with-different-weights">Networkx PageRank - Equal Ranks with Different Weights</a>).</p>
  
  <p>Essentially, I am using networkx to compute the pagerank on a graph. Since, pagerank computation first converts the graph to a right stochastic matrix (all out-going edges are normalised to one). </p>
  
  <p>What I need is a way to not normalise the edge weights. So, If one node as only one outgoing edge with weight 0.1 and another one has only one outgoing edge with weight 0.05, I want this information to be used in the computation of pagerank (rather than being normalized to 1 each).</p>
  
  <p>Does anyone know what could be the right way of modifying pagerank to achieve this.</p>
  
  <p>thanks in advance,
  Amit</p>