The scale-free conjecture for infinity-PageRank
Let be a graph with vertex set , and let be the degree of node . Suppose
where is a regularly varying random variable. Let denote the infinity-PageRank value of node .
Scale-free infinity-PageRank conjecture. If where is a regularly varying random variable, then will also be scale-free.
The conjecture concerns the transfer of heavy-tailed, regularly varying degree behavior to infinity-PageRank values. The source motivates it by similarity with known behavior of standard PageRank, but provides no proof or resolution.
References
- Cory Glover, Tyler Jones, Mark Kempton and Alice Oveson, “Effects of Backtracking on PageRank”, arXiv:2211.13353 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.