In the talk I'll tell about some methods of constructing web graph and its modelling. We compare web graphs constructed in different ways by comparing effectiveness of PageRank of pages from such graphs. Especially we focus on different methods of accounting redirects in the web graph. We measure the effectiveness by evaluating the NDCG@ metrics of linear combination of PageRank and BM-25 and an assessors' rating. In the end of the talk I'll tell about the new ways of calculating PageRank sensible to pages' freshness. We obtain the new algorithm ``Actual PageRank'' and prove that it is better than both classic PageRank and one of the most advanced recency-sensitive link analysis algorithms T-Fresh.