For the IPDPS ParSocial event a presentation submission is required by 15th May. The event is on 3rd June. https://gist.github.com/wolfram77/51b15ca09eb28f6909673a2deb1a314d DYNAMIC BATCH PARALLEL ALGORITHMS FOR UPDATING PAGERANK Subhajit Sahut, Kishore Kothapallit and Dip Sankar Banerjeet tInternational Institute of Information Technology Hyderabad, India. tIndian Institute of Technology Jodhpur, India. subhajit.sahu@research. ,kkishore@iiit.ac.in, dipsankarb@iitj.ac.in This work is partially supported by a grant from the Department of Science and Technology (DST), India, under the National Supercomputing Mission (NSM) R&D in Exascale initiative vide Ref. No: DST/NSM/R&D Exascale/2021/16. FACEBOOK 15 TAKING A PAGE OUT OF GOOGLE’S PLAYBOOK 10 STOP FAKE NEWS FROM GOING VIRAL PUBLISHED APR 2015 BY SALVADOR RODRIGUEZ Click-Gap: When is Facebook is driving disproportionate amounts of traffic to websites. Effort to rid fakes news from Facebook’s services. Is a website relying on Facebook to drive significant traffic, but not well ranked by the rest of the web? Also News Citation Graph. PAGERANK APPLICATIONS Ranking of websites. Measuring scientific impact of researchers. Finding the best teams and athletes. Ranking companies by talent concentration. Predicting road/foot traffic in urban spaces. Analysing protein networks. Finding the most authoritative news sources Identifying parts of brain that change jointly. Toxic waste management. PAGERANK APPLICATIONS Debugging complex software systems (Moni torRank) Finding the most original writers (BookRank) Finding topical authorities (TwitterRank) WHAT IS PAGERANK l—-d Plu = Cus + —— UCIiNny Pru u->v = (1-—d) x “us ( ) outdegy, PageRank is a lLink-analysis algorithm. By Larry Page and Sergey Brin in 1996. For ordering information on the web. Represented with a random-surfer model. Rank of a page is defined recursively. Calculate iteratively with power-iteration.