Skip to content

Instantly share code, notes, and snippets.

@wolfram77

wolfram77/notes-pagerank-on-an-evolving-graph-yanzhao-yang.md

Last active September 26, 2021 01:38
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save wolfram77/084356d1720c4409fe443b41e990ba2c to your computer and use it in GitHub Desktop.
Save wolfram77/084356d1720c4409fe443b41e990ba2c to your computer and use it in GitHub Desktop.
Download ZIP
PageRank on an evolving graph - Yanzhao Yang : NOTES
Raw
notes-pagerank-on-an-evolving-graph-yanzhao-yang.md

Highlighted notes while research with Prof. Dip Sankar Banerjee, Prof. Kishore Kothapalli:
PageRank on an evolving graph - Yanzhao Yang.
https://theory.utdallas.edu/seminar/G2S13/YY/Pagerank%20on%20evolving%20graph-Yanzhao%20Yang.pdf

Pagerank may be always imprecise, due to lack of knowledge of up-to-date/complete graph. Millions of hyperlinks/social-links modified each day. Which portions of the web should a crawler focus most (probing strategy)? Probing techniques discussed are Random probing, Round-robin probing, Proportional probing (random, proportional to node's pagerank), Priority probing (deterministic, pick node with highest cumulative pagerank sum), Hybrid probing (proportional + round-robin).

Display the source blob
Display the rendered blob
Raw
notes-pagerank-on-an-evolving-graph-yanzhao-yang.pdf
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment