Randomization and Gossiping in Techno-Social Networks
|
|
- Drusilla Peters
- 6 years ago
- Views:
Transcription
1 Randomization and Gossiping in Techno-Social Networks Roberto Tempo CNR-IEIIT Consiglio Nazionale delle Ricerche Politecnico ditorino
2 CPSN Social Network Layer humans Physical Layer GPS cyberphysical social networks
3 Techno-Social Networks Social networks (opinion dynamics) Centrality measures Technological networks (PageRank) Tools: randomization and gossiping Properties: ergodicity
4 Opinion Dynamics in Social Networks
5 Model of Opinion x is a numerical value representing the opinion that each agent (human) has about a specific topic Example: How much do you like soccer? Agents discuss the topic and exchange information with other agents
6 Stubborn and Open-Minded Agents Some agents are very stubborn Others are open-minded and willing to change their opinions Opinions oscillate around a mean value
7 Time Average Opinions Time average opinions do not show oscillations
8 Aggregation and Partial Consensus Each agent reaches a stable opinion which is not a global consensus Some agents aggregate into opinion clusters, others don t Need to model the opinions: bounded confidence models don t explain persistent disagreement
9 Friedkin and Johnsen Model of Opinions - 1 Discrete time model of opinions x(k+1) = ΛW x(k) + (I-Λ) v x(0) = v x is the belief or opinion (state) v is the prejudices (input) W interpersonal influences beetwen agents Λ (diag) sensitivity to opinion of other agents (weights) - W is row stochastic (W1 = 1)
10 Friedkin and Johnsen Model of Opinions - 2 Discrete time model of opinions x(k+1) = ΛW x(k) + (I-Λ) v x(0) = v endogeneously exogeneously W interpersonal influences beetwen agents Λ (diag) sensitivity to the opinion of other agents - W is row stochastic (W1 = 1) - Λ = I - diag(w)
11 Opinion Profile The opinion profile of agents is given by k-1 k j x( k) ( W ) ( W ) (I-) v j0 Question: Do the opinions converge to a stable opinion profile for k
12 Convergence of Opinion Dynamics Assumption (stubbornness): For any i, the i-th agent is either stubborn or is influenced (indirectly) by a stubborn agent This is N&S to establish convergence of opinions for k x opd = x(k) = (I - Λ W) -1 (I-Λ) v
13 Example (Friedkin and Johnsen) - 1 v W T diag v = x(0) prejudices W strength of interactions agent 3 is stubborn Λ sensitivity x opd T x opd final opinion
14 Example (Friedkin and Johnsen) - 2 Study opinion profile Red (stubborn) and cyan (open minded) agents reach a consensus Two distinct opinion clusters are formed Global consensus is not achieved
15 Model of Interpersonal Influences this model of social influence will be imperfect at some level it is obvious that interpersonal influences do not occur in the simultaneous way and that there are complex sequences of interpersonal influences in a group N.E. Friedkin and E.C. Johnsen (1999)
16 Global vs Local Information Interpersonal influences do not occur simultaneously Simultaneous access to the entire graph of opinions is not realistic No global exchange of information Agents discuss the topic within small groups (e.g. in pairs or in triples) Example: When a human needs to take a difficult decision about health (surgery or medical treatment), he/she discusses the matter within the family or friends
17 Key Point: Models for Information Exchange Consider directed graphs G (V,E) Synchronous model where all the agents (nodes) simultaneously exchange information through links Asynchronous model based on a local communication protocol (two agents)
18 Communications between Humans are becoming Increasingly Asynchronous Examples of asynchronous communications: text-based messages, , bulletin boards, blogs, forum, They are delivered via web technology and they are independent of time and place Examples of synchronous communications: phone and conference calls which require humans to decide a common time
19 Randomized Algorithm Randomized Algorithm (RA): An algorithm that makes random choices during its execution to produce a result (it is an algorithm that may fail to provide the correct answer, but the probability of this event can be made arbitrarily small) set_r =1:0.01:3; for k =1:length(set_r) if (rand > 0.5) then a_opt(k) = hel(k); else a_opt(k) = 3.7; end if end
20 Randomization in Sociology Jon Elster: Randomization in individual and social decisions Importance of randomization for designing experiments Example: Decide which patients may be selected to receive a standard or a new treatment for a disease
21 Key Ingredient 1: Randomized Gossip Protocol Gossip protocol based on (uniform) edge randomization Let θ(k) E be a sequence of independent identically distributed random variables (clock) Can we recover the global solution using only local information? Need to establish convergence properties of this protocol
22 Randomized Algorithm based on Local Opinions -1 Gossip interaction: at time k directed link (i,j) E is randomly sampled according to a (uniform) distribution in E
23 Randomized Algorithm based on Local Opinions - 2 At time k agents i and j exchange information Agent i updates its opinion based on the its previous opinion, the opinion of agent j and the initial prejudices v i j
24 Randomized Algorithm based on Local Opinions - 3 Agent i changes opinion based on interactions with j x ( k 1) h (1- γ ) x ( k) γ x ( k)) (1- h ) v where h i 0,1] and γ ij 0,1 are given coefficients The new opinion is a convex combination of opinions and of prejudices ( i i ij i ij j i i (1- γ ) x ( k) γ x ( k) ij i ij j h ((1- γ ) x ( k) γ x ( k)) (1- h ) v i ij i ij j i i
25 Randomized Algorithm based on Local Opinions - 3 Agent i changes opinion based on interactions with j ( x ( k 1) h (1- γ ) x ( k) γ x ( k)) (1- h ) v i i ij i ij j i i where h i 0,1] and γ ij 0,1 are given coefficients The new opinion is a convex combination of opinions (1- γ ) x ( k) γ x ( k) ij i ij j
26 Randomized Algorithm based on Local Opinions - 3 Agent i changes opinion based on interactions with j ( x ( k 1) h (1- γ ) x ( k) γ x ( k)) (1- h ) v i i ij i ij j i i where h i 0,1] and γ ij 0,1 are given coefficients The new opinion is a convex combination of opinions and of prejudices h ((1- γ ) x ( k) γ x ( k)) (1- h ) v i ij i ij j i i
27 Randomized Algorithm based on Local Opinions - 4 Agent i changes opinion based on interactions with j ( x ( k 1) h (1- γ ) x ( k) γ x ( k)) (1- h ) v i i ij i ij j i i The other agents l (l i) do not change opinion x ( k 1) x ( k) l Asymmetric update of information between i and j l
28 Weighting Coefficients h i 0,1] The weighting coefficients are given by h i 1 (1 λ i ) / d i if d i 1 0 otherwise where - d i degree of the vertex i (sum of # incoming edges to the node i and # outgoing edges from node i, also counting self loops) - λ i i-th entry of the sensitivity matrix Λ
29 Weighting Coefficients γ ij 0,1 The weighting coefficients γ ij are given by γ ij di (1 hi ) hi (1 λw i ii ) if i j, di 1 h i λw i ij if i j, di 1 hi 1 if i j, di 1 0 if i j, di 1
30 Undesired Oscillations The dynamics of the randomized gossip protocol x(k) oscillates and there is no convergence of the protocol!
31 Key Ingredient 2: Time Averaging Time averaging was introduced in the seventies to accelerate convergence of stochastic approximation algorithms
32 Time Average Gossip Opinion With time average we remove oscillations k 1 y( k) x( i) k 1 i0
33 Ergodicity and Limiting Behavior Theorem (convergence properties) Let stubbornness assumption hold The time average local opinions y(k) are mean-square ergodic and converge to x opd lim E [ y( k ) x ] 0 k opd 2 2 x opd = (I - Λ W) -1 (I-Λ) v P. Frasca, C. Ravazzi, R. Tempo, H. Ishii (2015)
34 Other Convergence Properties Randomized gossip protocol enjoys convergence w.p.1 Observation: randomized gossip protocol is a Markov jump system
35 Multidimensional Model of Opinions - 1 Motivations: Agents discuss two topics (soccer and tennis) Opinions are correlated New model defined using Kronecker products of stochastic matrices x(k+1) = (ΛW C) x(k) + ((I-Λ) I) v x(0)=v
36 Multidimensional Model of Opinions - 2 Extension of previous ergodicity results Given prejudices and final opinions, find correlation matrix C System is overdetermined Find an approximation of C, solving a convex regularized l 1 optimization problem S. Parsegov, A. Proskurnikov, R. Tempo, N. Friedkin (2015)
37 Centrality Measures in Social and Complex Networks
38 Network Centrality Measures How central is an individual in a social network? Degree Closeness Beetweenness PageRank
39 Degree Centrality Degree centrality: for each node count the number of incoming links
40 Closeness Centrality Closeness centrality: a node is more central if it is closer to most of the other nodes Defined as the total distance from all the other nodes 2 => 1 dist = 1 3 => 1 dist = 2 4 => 1 dist = 3 5 => 1 dist = 5 6 => 1 dist = 4 total = 15
41 Betweenness Centrality B 1 # shortest paths i j passing through 1, i j 1 # shortest paths i j, i j 1 2 => => => => => 4 1/2 total = 1/2 + 1/3 = 5/6 2 => 5 1/3 2 => => => => 6 0
42 PageRank Problem
43 PageRank for Oberwolfach PageRank is a numerical value in the interval [0,1] Using a PageRank checker we compute PageRank is Google s view of the importance of this page PageRank reflects our view of the importance of Web pages by considering more than 500 million variables and 2 billion terms. Pages that are considered important receive a higher PageRank and are more likely to appear at the top of the search results
44 Random Surfer Model Network consisting of servers (nodes) connected by directed communication links Web surfer moves along randomly following the hyperlink structure When arriving at a page with several outgoing links, one is chosen at random, then the random surfer moves to a new page, and so on
45 Graph Representation Directed graph with nodes (pages) and links representing the web Graph is constructed using crawlers and spiders moving continuously along the web Hyperlink matrix: column substochastic
46 Hyperlink Matrix Page 5 is a Dangling Node A / / 2 0 1/ / 2 0 1/ Example: pdf file with no hyperlink random surfer is stuck!
47 Benchmark Benchmark: Web Lincoln University, New Zealand 3756 nodes total #outgoing links H. Ishii, R. Tempo (2014)
48 Dangling Nodes Red dots outgoing links toward dangling nodes 3255 dangling nodes (85%) Blue dots are normal links White area corresponds to no-links
49 Easy Fix: Back Button Random surfer gets stuck when visiting a pdf file In this case the back button of the browser is used Easy fix: Add new links to make the matrix stochastic
50 Easy Fix: Add New Link We add a new outgoing link from page 5 to page / / 2 0 A 1/ / 2 1 1/ In the benchmark this fix increases the #links from to to 40646
51 Assumption: No Dangling Nodes Hyperlink matrix A is a nonnegative stochastic matrix (instead of substochastic)
52 Random Surfer Model and Markov Chains Random surfer model is represented as a Markov chain x( k 1) Ax( k) where x(k) is a probability vector x(k) [0,1] n and i x i (k) = 1 x i (k) represents the importance of the page i at time k
53 Convergence of the Markov Chain Question: Does the Markov chain converge to a stationary value x(k) x* for k representing the probability that the pages are visited? Answer: No Example: A x(0) x 1 (k) k
54 Teleportation Model Recall that the matrix A is a nonnegative stochastic matrix We introduce a different model Teleportation: After a while the random surfer gets bored and decides to jump to another page not directly connected to that currently visited New page may be geographically or content-based located far away
55 Convex Combination of Matrices Teleportation model is represented as a convex combination of matrices A and S/n 1 1 S = 1 1 T is a rank-one matrix S 1 vector with all entries equal to one 1 1 Consider a matrix M defined as M = (1 - m) A + m/n S m (0,1) where n is the number of pages The value m = 0.15 is used at Google
56 Matrix M M is a convex combination of two nonnegative stochastic matrices and m (0,1) M is a strictly positive stochastic matrix
57 Convergence of the Markov Chain Consider the Markov chain x(k+1) = M x(k) where M is a strictly positive stochastic matrix If i x i (0) = 1 convergence is guaranteed by Perron Theorem x(k) x* for k x* = M x* = [(1 - m) A + m/n S] x* m (0,1) Corresponding graph is strongly connected
58 PageRank: Bringing Order to the Web Rank n web pages in order of importance Ranking is provided by x* PageRank x* of the hyperlink matrix M is defined as x*=m x* where x* [0,1] n and i x i * = 1 S. Brin, L. Page (1998)
59 PageRank: Bringing Order to the Web Rank n web pages in order of importance Ranking is provided by x* PageRank x* of the hyperlink matrix M is defined as x*=m x* where x* [0,1] n and i x i * = 1 x* is the stationary distribution of the Markov Chain (steady-state probability that pages are visited is x* ) x* is a nonnegative unit eigenvector corresponding to the eigenvalue 1 of M
60 PageRank Computation
61 PageRank Computation with Power Method PageRank is computed with the power method x(k+1) = M x(k) PageRank computation requires iterations (40 in the benchmark) This computation takes about a week and it is performed centrally at Google once a month
62 Why m = 0.15? Asymptotic rate of convergence of power method is exponential and given by We have λ 2 λ 1 (M) = 1 2 (M) 1 - m = 0.85 For N it = 50 we have For N it = 100 we have Larger m implies faster convergence, but numerically unstable 1 1
63 PageRank Computation with Power Method / / 2 1/ 3 A 0 1/ 2 0 1/ 3 0 1/ 2 1/ 2 0 M m x* T
64 Size of the Web The size of M is more than 8 billion (and it is increasing)! Sparsity in the web: entries non-zero entries
65 Distributed Viewpoint More and more computing power is needed develop distributed algorithms for PageRank computation H. Ishii and R. Tempo (IEEE TAC 2011) W.-X. Zhao, H. F. Chen, H. Fang (IEEE TAC 2013) O. Fercoq, M. Akian, M. Bouhtou S. Gaubert (IEEE TAC 2013) H. Ishii, R. Tempo, E.-W. Bai (IEEE TAC 2013)
66 Conclusions: Ranking (Control) Journals
67 Ranking Journals: Impact Factor Impact Factor IF IF 2013 number citations in 2013 of articles published in number of articles published in Census period (2013) of one year and a window period ( ) of two years Remark: Impact Factor is a flat criterion (it does not take into account where the citations come from)
68 ISI Web of Knowledge
69 Ranking Journals: Eigenfactor Eigenfactor EF Ranking journals using ideas from PageRank computation in Google In Eigenfactor journals are considered influential if they are cited often by other influential journals What is the probability that a journal is cited? C. T. Bergstrom (2007)
70 2013 Impact Factor 2013 Eigenfactor TM 3.4 IEEE CSM CNR-IEIIT 1 Automatica IEEE TAC 2 IEEE TAC Automatica 3 SIAM J Contr & Opt Int J Rob Nonlin Contr 4 Syst & Contr Lett IEEE TCST 5 IEEE TCST J Proc Contr 6 Int J Contr Contr Eng Pract 7 Int J Rob Nonlin Contr Syst & Contr Lett 8 J Proc Contr SIAM J Contr & Opt 9 Contr Eng Pract Math Contr Sign Sys 10 IEEE CSM Int J Contr 11 Europ J Contr Europ J Contr 12 Math Contr Sig Sys 0.001
Uncertainty and Randomization
Uncertainty and Randomization The PageRank Computation in Google Roberto Tempo IEIIT-CNR Politecnico di Torino tempo@polito.it 1993: Robustness of Linear Systems 1993: Robustness of Linear Systems 16 Years
More informationThe PageRank Computation in Google: Randomization and Ergodicity
The PageRank Computation in Google: Randomization and Ergodicity Roberto Tempo CNR-IEIIT Consiglio Nazionale delle Ricerche Politecnico di Torino roberto.tempo@polito.it Randomization over Networks - 1
More informationDinamiche di opinioni: un po di testardaggine non fa mai male
Dinamiche di opinioni: un po di testardaggine non fa mai male Chiara Ravazzi Consiglio Nazionale delle ricerche (CNR) Istituto di elettronica e di ingegneria dell informazione e delle telecomunicazioni
More informationThe PageRank Problem, Multi-Agent. Consensus and Web Aggregation
The PageRank Problem, Multi-Agent Consensus and Web Aggregation A Systems and Control Viewpoint arxiv:32.904v [cs.sy] 6 Dec 203 Hideaki Ishii and Roberto Tempo PageRank is an algorithm introduced in 998
More informationDistributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 55, NO. 9, SEPTEMBER 2010 1987 Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE Abstract
More informationLab 8: Measuring Graph Centrality - PageRank. Monday, November 5 CompSci 531, Fall 2018
Lab 8: Measuring Graph Centrality - PageRank Monday, November 5 CompSci 531, Fall 2018 Outline Measuring Graph Centrality: Motivation Random Walks, Markov Chains, and Stationarity Distributions Google
More informationPseudocode for calculating Eigenfactor TM Score and Article Influence TM Score using data from Thomson-Reuters Journal Citations Reports
Pseudocode for calculating Eigenfactor TM Score and Article Influence TM Score using data from Thomson-Reuters Journal Citations Reports Jevin West and Carl T. Bergstrom November 25, 2008 1 Overview There
More informationGraph Models The PageRank Algorithm
Graph Models The PageRank Algorithm Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 The PageRank Algorithm I Invented by Larry Page and Sergey Brin around 1998 and
More informationA Note on Google s PageRank
A Note on Google s PageRank According to Google, google-search on a given topic results in a listing of most relevant web pages related to the topic. Google ranks the importance of webpages according to
More informationLink Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
More informationTopics in Social Networks: Opinion Dynamics and Control
Topics in Social Networks: Opinion Dynamics and Control Paolo Frasca DISMA, Politecnico di Torino, Italy IEIIT-CNR, Torino May 23, 203 Outline Opinion dynamics Models overview: similarities and differences
More informationLink Analysis Information Retrieval and Data Mining. Prof. Matteo Matteucci
Link Analysis Information Retrieval and Data Mining Prof. Matteo Matteucci Hyperlinks for Indexing and Ranking 2 Page A Hyperlink Page B Intuitions The anchor text might describe the target page B Anchor
More informationIntroduction to Search Engine Technology Introduction to Link Structure Analysis. Ronny Lempel Yahoo Labs, Haifa
Introduction to Search Engine Technology Introduction to Link Structure Analysis Ronny Lempel Yahoo Labs, Haifa Outline Anchor-text indexing Mathematical Background Motivation for link structure analysis
More informationLink Analysis. Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze
Link Analysis Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze 1 The Web as a Directed Graph Page A Anchor hyperlink Page B Assumption 1: A hyperlink between pages
More informationMath 304 Handout: Linear algebra, graphs, and networks.
Math 30 Handout: Linear algebra, graphs, and networks. December, 006. GRAPHS AND ADJACENCY MATRICES. Definition. A graph is a collection of vertices connected by edges. A directed graph is a graph all
More informationASOCIAL network is an important and attractive case study
2270 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 62, NO. 5, MAY 2017 Novel Multidimensional Models of Opinion Dynamics in Social Networks Sergey E. Parsegov, Anton V. Proskurnikov, Member, IEEE, Roberto
More informationPage rank computation HPC course project a.y
Page rank computation HPC course project a.y. 2015-16 Compute efficient and scalable Pagerank MPI, Multithreading, SSE 1 PageRank PageRank is a link analysis algorithm, named after Brin & Page [1], and
More informationHow does Google rank webpages?
Linear Algebra Spring 016 How does Google rank webpages? Dept. of Internet and Multimedia Eng. Konkuk University leehw@konkuk.ac.kr 1 Background on search engines Outline HITS algorithm (Jon Kleinberg)
More informationLink Mining PageRank. From Stanford C246
Link Mining PageRank From Stanford C246 Broad Question: How to organize the Web? First try: Human curated Web dictionaries Yahoo, DMOZ LookSmart Second try: Web Search Information Retrieval investigates
More informationPageRank. Ryan Tibshirani /36-662: Data Mining. January Optional reading: ESL 14.10
PageRank Ryan Tibshirani 36-462/36-662: Data Mining January 24 2012 Optional reading: ESL 14.10 1 Information retrieval with the web Last time we learned about information retrieval. We learned how to
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More information1998: enter Link Analysis
1998: enter Link Analysis uses hyperlink structure to focus the relevant set combine traditional IR score with popularity score Page and Brin 1998 Kleinberg Web Information Retrieval IR before the Web
More informationNovel Multidimensional Models of Opinion Dynamics in Social Networks
1 Novel Multidimensional Models of Opinion Dynamics in Social Networks Sergey E. Parsegov, Anton V. Proskurnikov, Member, IEEE, Roberto Tempo, Fellow, IEEE and Noah E. Friedkin arxiv:155.492v5 [cs.sy]
More informationDistributed Optimization over Networks Gossip-Based Algorithms
Distributed Optimization over Networks Gossip-Based Algorithms Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Random
More informationDATA MINING LECTURE 13. Link Analysis Ranking PageRank -- Random walks HITS
DATA MINING LECTURE 3 Link Analysis Ranking PageRank -- Random walks HITS How to organize the web First try: Manually curated Web Directories How to organize the web Second try: Web Search Information
More informationGoogle PageRank. Francesco Ricci Faculty of Computer Science Free University of Bozen-Bolzano
Google PageRank Francesco Ricci Faculty of Computer Science Free University of Bozen-Bolzano fricci@unibz.it 1 Content p Linear Algebra p Matrices p Eigenvalues and eigenvectors p Markov chains p Google
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu How to organize/navigate it? First try: Human curated Web directories Yahoo, DMOZ, LookSmart
More informationComputing PageRank using Power Extrapolation
Computing PageRank using Power Extrapolation Taher Haveliwala, Sepandar Kamvar, Dan Klein, Chris Manning, and Gene Golub Stanford University Abstract. We present a novel technique for speeding up the computation
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationWeb Ranking. Classification (manual, automatic) Link Analysis (today s lesson)
Link Analysis Web Ranking Documents on the web are first ranked according to their relevance vrs the query Additional ranking methods are needed to cope with huge amount of information Additional ranking
More informationLecture: Local Spectral Methods (1 of 4)
Stat260/CS294: Spectral Graph Methods Lecture 18-03/31/2015 Lecture: Local Spectral Methods (1 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationData Mining and Matrices
Data Mining and Matrices 10 Graphs II Rainer Gemulla, Pauli Miettinen Jul 4, 2013 Link analysis The web as a directed graph Set of web pages with associated textual content Hyperlinks between webpages
More informationGoogle Page Rank Project Linear Algebra Summer 2012
Google Page Rank Project Linear Algebra Summer 2012 How does an internet search engine, like Google, work? In this project you will discover how the Page Rank algorithm works to give the most relevant
More informationMathematical Properties & Analysis of Google s PageRank
Mathematical Properties & Analysis of Google s PageRank Ilse Ipsen North Carolina State University, USA Joint work with Rebecca M. Wills Cedya p.1 PageRank An objective measure of the citation importance
More informationNode Centrality and Ranking on Networks
Node Centrality and Ranking on Networks Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More information0.1 Naive formulation of PageRank
PageRank is a ranking system designed to find the best pages on the web. A webpage is considered good if it is endorsed (i.e. linked to) by other good webpages. The more webpages link to it, and the more
More informationLink Analysis. Leonid E. Zhukov
Link Analysis Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/7/2012 Jure Leskovec, Stanford C246: Mining Massive Datasets 2 Web pages are not equally important www.joe-schmoe.com
More informationeigenvalues, markov matrices, and the power method
eigenvalues, markov matrices, and the power method Slides by Olson. Some taken loosely from Jeff Jauregui, Some from Semeraro L. Olson Department of Computer Science University of Illinois at Urbana-Champaign
More informationCalculating Web Page Authority Using the PageRank Algorithm
Jacob Miles Prystowsky and Levi Gill Math 45, Fall 2005 1 Introduction 1.1 Abstract In this document, we examine how the Google Internet search engine uses the PageRank algorithm to assign quantitatively
More informationUpdating PageRank. Amy Langville Carl Meyer
Updating PageRank Amy Langville Carl Meyer Department of Mathematics North Carolina State University Raleigh, NC SCCM 11/17/2003 Indexing Google Must index key terms on each page Robots crawl the web software
More information6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search
6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search Daron Acemoglu and Asu Ozdaglar MIT September 30, 2009 1 Networks: Lecture 7 Outline Navigation (or decentralized search)
More informationThe Google Markov Chain: convergence speed and eigenvalues
U.U.D.M. Project Report 2012:14 The Google Markov Chain: convergence speed and eigenvalues Fredrik Backåker Examensarbete i matematik, 15 hp Handledare och examinator: Jakob Björnberg Juni 2012 Department
More informationMajorizations for the Eigenvectors of Graph-Adjacency Matrices: A Tool for Complex Network Design
Majorizations for the Eigenvectors of Graph-Adjacency Matrices: A Tool for Complex Network Design Rahul Dhal Electrical Engineering and Computer Science Washington State University Pullman, WA rdhal@eecs.wsu.edu
More informationSlides based on those in:
Spyros Kontogiannis & Christos Zaroliagis Slides based on those in: http://www.mmds.org High dim. data Graph data Infinite data Machine learning Apps Locality sensitive hashing PageRank, SimRank Filtering
More informationSlide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University.
Slide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University http://www.mmds.org #1: C4.5 Decision Tree - Classification (61 votes) #2: K-Means - Clustering
More informationLink Analysis. Stony Brook University CSE545, Fall 2016
Link Analysis Stony Brook University CSE545, Fall 2016 The Web, circa 1998 The Web, circa 1998 The Web, circa 1998 Match keywords, language (information retrieval) Explore directory The Web, circa 1998
More informationIR: Information Retrieval
/ 44 IR: Information Retrieval FIB, Master in Innovation and Research in Informatics Slides by Marta Arias, José Luis Balcázar, Ramon Ferrer-i-Cancho, Ricard Gavaldá Department of Computer Science, UPC
More informationData Mining Recitation Notes Week 3
Data Mining Recitation Notes Week 3 Jack Rae January 28, 2013 1 Information Retrieval Given a set of documents, pull the (k) most similar document(s) to a given query. 1.1 Setup Say we have D documents
More informationMAE 298, Lecture 8 Feb 4, Web search and decentralized search on small-worlds
MAE 298, Lecture 8 Feb 4, 2008 Web search and decentralized search on small-worlds Search for information Assume some resource of interest is stored at the vertices of a network: Web pages Files in a file-sharing
More informationNode and Link Analysis
Node and Link Analysis Leonid E. Zhukov School of Applied Mathematics and Information Science National Research University Higher School of Economics 10.02.2014 Leonid E. Zhukov (HSE) Lecture 5 10.02.2014
More informationMonte Carlo methods in PageRank computation: When one iteration is sufficient
Monte Carlo methods in PageRank computation: When one iteration is sufficient Nelly Litvak (University of Twente, The Netherlands) e-mail: n.litvak@ewi.utwente.nl Konstantin Avrachenkov (INRIA Sophia Antipolis,
More informationIntelligent Data Analysis. PageRank. School of Computer Science University of Birmingham
Intelligent Data Analysis PageRank Peter Tiňo School of Computer Science University of Birmingham Information Retrieval on the Web Most scoring methods on the Web have been derived in the context of Information
More informationApplications of The Perron-Frobenius Theorem
Applications of The Perron-Frobenius Theorem Nate Iverson The University of Toledo Toledo, Ohio Motivation In a finite discrete linear dynamical system x n+1 = Ax n What are sufficient conditions for x
More informationPr[positive test virus] Pr[virus] Pr[positive test] = Pr[positive test] = Pr[positive test]
146 Probability Pr[virus] = 0.00001 Pr[no virus] = 0.99999 Pr[positive test virus] = 0.99 Pr[positive test no virus] = 0.01 Pr[virus positive test] = Pr[positive test virus] Pr[virus] = 0.99 0.00001 =
More informationAgreement algorithms for synchronization of clocks in nodes of stochastic networks
UDC 519.248: 62 192 Agreement algorithms for synchronization of clocks in nodes of stochastic networks L. Manita, A. Manita National Research University Higher School of Economics, Moscow Institute of
More informationWeb Structure Mining Nodes, Links and Influence
Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.
More informationThe Second Eigenvalue of the Google Matrix
The Second Eigenvalue of the Google Matrix Taher H. Haveliwala and Sepandar D. Kamvar Stanford University {taherh,sdkamvar}@cs.stanford.edu Abstract. We determine analytically the modulus of the second
More informationQuantized Average Consensus on Gossip Digraphs
Quantized Average Consensus on Gossip Digraphs Hideaki Ishii Tokyo Institute of Technology Joint work with Kai Cai Workshop on Uncertain Dynamical Systems Udine, Italy August 25th, 2011 Multi-Agent Consensus
More informationData and Algorithms of the Web
Data and Algorithms of the Web Link Analysis Algorithms Page Rank some slides from: Anand Rajaraman, Jeffrey D. Ullman InfoLab (Stanford University) Link Analysis Algorithms Page Rank Hubs and Authorities
More informationWeb Ranking. Classification (manual, automatic) Link Analysis (today s lesson)
Link Analysis Web Ranking Documents on the web are first ranked according to their relevance vrs the query Additional ranking methods are needed to cope with huge amount of information Additional ranking
More informationHow works. or How linear algebra powers the search engine. M. Ram Murty, FRSC Queen s Research Chair Queen s University
How works or How linear algebra powers the search engine M. Ram Murty, FRSC Queen s Research Chair Queen s University From: gomath.com/geometry/ellipse.php Metric mishap causes loss of Mars orbiter
More informationAlgebraic Representation of Networks
Algebraic Representation of Networks 0 1 2 1 1 0 0 1 2 0 0 1 1 1 1 1 Hiroki Sayama sayama@binghamton.edu Describing networks with matrices (1) Adjacency matrix A matrix with rows and columns labeled by
More informationOn the mathematical background of Google PageRank algorithm
Working Paper Series Department of Economics University of Verona On the mathematical background of Google PageRank algorithm Alberto Peretti, Alberto Roveda WP Number: 25 December 2014 ISSN: 2036-2919
More informationMATH36001 Perron Frobenius Theory 2015
MATH361 Perron Frobenius Theory 215 In addition to saying something useful, the Perron Frobenius theory is elegant. It is a testament to the fact that beautiful mathematics eventually tends to be useful,
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationTen good reasons to use the Eigenfactor TM metrics
Ten good reasons to use the Eigenfactor TM metrics Massimo Franceschet Department of Mathematics and Computer Science, University of Udine Via delle Scienze 206 33100 Udine, Italy massimo.franceschet@dimi.uniud.it
More informationCS6220: DATA MINING TECHNIQUES
CS6220: DATA MINING TECHNIQUES Mining Graph/Network Data Instructor: Yizhou Sun yzsun@ccs.neu.edu November 16, 2015 Methods to Learn Classification Clustering Frequent Pattern Mining Matrix Data Decision
More informationFinding central nodes in large networks
Finding central nodes in large networks Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands Woudschoten Conference 2017 Complex networks Networks: Internet, WWW, social
More informationLecture 12: Link Analysis for Web Retrieval
Lecture 12: Link Analysis for Web Retrieval Trevor Cohn COMP90042, 2015, Semester 1 What we ll learn in this lecture The web as a graph Page-rank method for deriving the importance of pages Hubs and authorities
More informationGoogle Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse)
Google Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse) wwwquantwareups-tlsefr/dima based on: OGiraud, BGeorgeot, DLS (CNRS, Toulouse) => PRE 8, 267 (29) DLS, OVZhirov
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationApplication. Stochastic Matrices and PageRank
Application Stochastic Matrices and PageRank Stochastic Matrices Definition A square matrix A is stochastic if all of its entries are nonnegative, and the sum of the entries of each column is. We say A
More informationComplex Social System, Elections. Introduction to Network Analysis 1
Complex Social System, Elections Introduction to Network Analysis 1 Complex Social System, Network I person A voted for B A is more central than B if more people voted for A In-degree centrality index
More informationToday. Next lecture. (Ch 14) Markov chains and hidden Markov models
Today (Ch 14) Markov chains and hidden Markov models Graphical representation Transition probability matrix Propagating state distributions The stationary distribution Next lecture (Ch 14) Markov chains
More informationPageRank algorithm Hubs and Authorities. Data mining. Web Data Mining PageRank, Hubs and Authorities. University of Szeged.
Web Data Mining PageRank, University of Szeged Why ranking web pages is useful? We are starving for knowledge It earns Google a bunch of money. How? How does the Web looks like? Big strongly connected
More informationCSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68
CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68 References 1 L. Freeman, Centrality in Social Networks: Conceptual Clarification, Social Networks, Vol. 1, 1978/1979, pp. 215 239. 2 S. Wasserman
More informationApplications. Nonnegative Matrices: Ranking
Applications of Nonnegative Matrices: Ranking and Clustering Amy Langville Mathematics Department College of Charleston Hamilton Institute 8/7/2008 Collaborators Carl Meyer, N. C. State University David
More informationConditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina
Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic
More informationA hybrid reordered Arnoldi method to accelerate PageRank computations
A hybrid reordered Arnoldi method to accelerate PageRank computations Danielle Parker Final Presentation Background Modeling the Web The Web The Graph (A) Ranks of Web pages v = v 1... Dominant Eigenvector
More informationAnalysis of Google s PageRank
Analysis of Google s PageRank Ilse Ipsen North Carolina State University Joint work with Rebecca M. Wills AN05 p.1 PageRank An objective measure of the citation importance of a web page [Brin & Page 1998]
More informationMultiRank and HAR for Ranking Multi-relational Data, Transition Probability Tensors, and Multi-Stochastic Tensors
MultiRank and HAR for Ranking Multi-relational Data, Transition Probability Tensors, and Multi-Stochastic Tensors Michael K. Ng Centre for Mathematical Imaging and Vision and Department of Mathematics
More informationLecture: Local Spectral Methods (2 of 4) 19 Computing spectral ranking with the push procedure
Stat260/CS294: Spectral Graph Methods Lecture 19-04/02/2015 Lecture: Local Spectral Methods (2 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University.
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu What is the structure of the Web? How is it organized? 2/7/2011 Jure Leskovec, Stanford C246: Mining Massive
More informationPart A. P (w 1 )P (w 2 w 1 )P (w 3 w 1 w 2 ) P (w M w 1 w 2 w M 1 ) P (w 1 )P (w 2 w 1 )P (w 3 w 2 ) P (w M w M 1 )
Part A 1. A Markov chain is a discrete-time stochastic process, defined by a set of states, a set of transition probabilities (between states), and a set of initial state probabilities; the process proceeds
More informationKrylov Subspace Methods to Calculate PageRank
Krylov Subspace Methods to Calculate PageRank B. Vadala-Roth REU Final Presentation August 1st, 2013 How does Google Rank Web Pages? The Web The Graph (A) Ranks of Web pages v = v 1... Dominant Eigenvector
More informationAnalysis and Computation of Google s PageRank
Analysis and Computation of Google s PageRank Ilse Ipsen North Carolina State University, USA Joint work with Rebecca S. Wills ANAW p.1 PageRank An objective measure of the citation importance of a web
More informationMATH3200, Lecture 31: Applications of Eigenvectors. Markov Chains and Chemical Reaction Systems
Lecture 31: Some Applications of Eigenvectors: Markov Chains and Chemical Reaction Systems Winfried Just Department of Mathematics, Ohio University April 9 11, 2018 Review: Eigenvectors and left eigenvectors
More informationCOMPSCI 514: Algorithms for Data Science
COMPSCI 514: Algorithms for Data Science Arya Mazumdar University of Massachusetts at Amherst Fall 2018 Lecture 4 Markov Chain & Pagerank Homework Announcement Show your work in the homework Write the
More informationCONVERGENCE ANALYSIS OF A PAGERANK UPDATING ALGORITHM BY LANGVILLE AND MEYER
CONVERGENCE ANALYSIS OF A PAGERANK UPDATING ALGORITHM BY LANGVILLE AND MEYER ILSE C.F. IPSEN AND STEVE KIRKLAND Abstract. The PageRank updating algorithm proposed by Langville and Meyer is a special case
More informationDegree Distribution: The case of Citation Networks
Network Analysis Degree Distribution: The case of Citation Networks Papers (in almost all fields) refer to works done earlier on same/related topics Citations A network can be defined as Each node is
More informationApplications to network analysis: Eigenvector centrality indices Lecture notes
Applications to network analysis: Eigenvector centrality indices Lecture notes Dario Fasino, University of Udine (Italy) Lecture notes for the second part of the course Nonnegative and spectral matrix
More informationThe Push Algorithm for Spectral Ranking
The Push Algorithm for Spectral Ranking Paolo Boldi Sebastiano Vigna March 8, 204 Abstract The push algorithm was proposed first by Jeh and Widom [6] in the context of personalized PageRank computations
More informationComputational Economics and Finance
Computational Economics and Finance Part II: Linear Equations Spring 2016 Outline Back Substitution, LU and other decomposi- Direct methods: tions Error analysis and condition numbers Iterative methods:
More informationNo class on Thursday, October 1. No office hours on Tuesday, September 29 and Thursday, October 1.
Stationary Distributions Monday, September 28, 2015 2:02 PM No class on Thursday, October 1. No office hours on Tuesday, September 29 and Thursday, October 1. Homework 1 due Friday, October 2 at 5 PM strongly
More informationLesson Plan. AM 121: Introduction to Optimization Models and Methods. Lecture 17: Markov Chains. Yiling Chen SEAS. Stochastic process Markov Chains
AM : Introduction to Optimization Models and Methods Lecture 7: Markov Chains Yiling Chen SEAS Lesson Plan Stochastic process Markov Chains n-step probabilities Communicating states, irreducibility Recurrent
More informationAsymptotics, asynchrony, and asymmetry in distributed consensus
DANCES Seminar 1 / Asymptotics, asynchrony, and asymmetry in distributed consensus Anand D. Information Theory and Applications Center University of California, San Diego 9 March 011 Joint work with Alex
More information6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities
6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities 1 Outline Outline Dynamical systems. Linear and Non-linear. Convergence. Linear algebra and Lyapunov functions. Markov
More information