Google Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse)

Size: px
Start display at page:

Download "Google Matrix, dynamical attractors and Ulam networks Dima Shepelyansky (CNRS, Toulouse)"

Transcription

1 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 (CNRS, Toulouse & BINP, Novosibirsk) => arxiv:95462 WWW of sites Information search engines PageRank algorithm Network models Dynamical attractors, Ulam networks Fractal Weyl law S Brin and L Page, Computer Networks and ISDN Systems,7 (998) (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 / 2

2 How Google works PageRank Algorithm Ranking pages {,,N} according to their importance Method: The importance of a page i depends on the importance of the pages j pointing on it If a page has many outgoing links the importance it transmits is proportional to the number of pages it points to The Google Matrix: G = αs + ( α)e/n here E is such a matrix that E ij = With a certain (stochastic) matrix S p = Sp (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 2 / 2

3 How Google works Directed networks Weighted adjacency matrix 2 S = 2 For a directed network with N nodes the adjacency matrix A is defined as A ij = if there is a link from node j to node i and A ij = otherwise The weighted adjacency matrix is S ij = A ij / k A kj In addition the elements of columns with only zeros elements are replaced by /N (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 / 2

4 How Google works Computation of PageRank p = Sp p= stationary vector of S: can be computed by iteration of S To remove convergence problems: Replace columns of (dangling nodes) by N : In our example, S = To remove degeneracies of the eigenvalue, replace S by G = αs + ( α) E ; Gp = λp => Perron-Frobenius operator N α models a random surfer with a random jump after approximately 6 clicks (usually α = 85); PageRank vector => p at λ = ( j p j = ) (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 4 / 2

5 Models of real networks Real networks are characterized by: small world property: average distance between 2 nodes log N scale-free property: distribution of the number of outgoing or incoming links P(k) k γ Can be explained by a twofold mechanism: Constant growth: new nodes appear regularly and are attached to the network Preferential attachment: nodes are preferentially linked to already highly connected vertices PageRank vector for large WWW: p j /j β, wher j is the ordered index number of nodes N n with PageRank p scales as N n /p ν with numerical values ν = + /β 2 and β 9 (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 5 / 2

6 Albert-Barabasi (AB) model Weight of a link chosen to be Π i = k i + j (k j + ), with k i being number of incoming+outgoing links Procedure from m nodes: starting from m nodes, at each step m links are added to the existing network with probability p (preferential attachment, start nodes are chosen randomly) or m links are rewired with probability q or a new node with m links is added with probability p q End vertex i always chosen with probability Π i We fix m = 5, p = 2, q = (scale-free) and q = 7 (exponential regimes) R Albert and A-L Barabási, Phys Rev Lett 85, 524 (2) (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 6 / 2

7 Eigenvalues of Google Matrix for AB model Distribution of eigenvalues λ i of Google matrices in the complex plane Color is proportional to the PAR ξ of the associated eigenvector ψ i Top panel: AB model with q = for N = 2 4 for N r = 5 random realizations (see text), ξ varies from ξ = 2 (blue) to ξ = 656 (red); middle panel: same with q = 7, ξ varies from ξ = 69 (red) to ξ = 584 (purple); bottom panel: data for a university network (Liverpool J Moores Univ - LJMU) with N = 578, here in order to get statistically significant data the WWW network was randomized and data correspond to N r = 5 random realizations, ξ varies from ξ = 7 (blue) to ξ = 77 (red) (participation ratio PAR => ξ = ( P j ψ i(j) 2 ) 2 / P j ψ i(j) 4 ; Gψ i = λ i ψ i ) (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 7 / 2

8 Density of states and participation ratio 4 ξ W(γ) W(γ) ξ γ γ Normalized density of states W (top panel) and PAR (bottom panel) as a function of γ Data for AB model with q = are shown by full curves with from bottom to top N = 2 (N r = ) (black), 2 (N r = 5) (red), 2 2 (N r = 2) (green), 2 (N r = ) (blue), 2 4 (N r = 5) (violet) Symbols give the PageRank value of ξ in the same order: circle, square, diamond, triangle down and triangle up All curves coincide on the top panel Dashed curves show the data from the WWW (LJMU network, parameters of previous Fig) Here λ = exp( γ/2) Same for AB model at q = 7 (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 8 / 2

9 Dependence on matrix size N log ξ log N Dependence of ξ on matrix size N for AB model at q = (triangles), q = 7 (circles), and for WWW data without randomization (squares) Full symbols are for PageRank ξ values, empty symbols are for eigenvectors with < γ < 4 (AB model) or for the eigenvectors with highest ξ and γ < (WWW data) For AB model N r is as before and N r = 5 for N > 2 4 (statistical error bars are smaller than symbol size) Dotted blue lines give linear fits of WWW data, with slopes respectively and 5 Upper dashed line indicates the slope Logarithms are decimal (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 9 / 2

10 Shapes of eigenvectors log ψ i (j) - -2 log P c (p j ) log p j log j Dependence of eigenvectors ψ i (j) of AB model on index j ordered in decreasing PageRank values p j (with normalisation P j ψ i(j) 2 = and P j p j = ) Full smooth curves are PageRank vectors for N = 2 4, dashed smooth curves for N = 2 9 Non-smooth curves are eigenvectors (N = 2 4 ) within < γ < 4 with Ψ i (j) 2 averaged in this interval States are averaged over N r = 5 random networks Black is for q =, red/grey for q = 7 Inset: cumulative distribution P c(p j ) normalized by P c() = N for AB model (N = 2 8 and N r = 5) at q = (full black) and q = 7 (dashed red/grey), and for LJMU non-randomized data (full red/grey) Dashed straight line indicates slope ν = Logarithms are decimal (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 / 2

11 Ulam networks Ulam conjecture (method) for discrete approximant of Perron-Frobenius operator of dynamical systems SMUlam, A Collection of mathematical problems, Interscience, 8, 7 NY (96) A rigorous prove for hyperbolic maps: T-YLi JApprox Theory 7, 77 (976) Related works: Z Kovacs and T Tel, Phys Rev A 4, 464 (989) MBlank, GKeller, and CLiverani, Nonlinearity 5, 95 (22) DTerhesiu and GFroyland, Nonlinearity 2, 95 (28) Links to Markov chains: Contre-example: Hamiltonian systems with invariant curves, eg the Chirikov standard map: noise, induced by coarse-graining, destroys the KAM curves and gives homogeneous ergodic eigenvector at λ = thanks to Arkady Pikovsky for a remark about the Ulam method (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 / 2

12 Google matrix of dynamical attractors Weak point of AB model => large gap, no sensitivity to α PageRank p j for the Google matrix generated by the Chirikov typical map at T =, k = 22, η = 99 (set T, top row) and T = 2, k =, η = 97 (set T 2, bottom row) with α =, 95, 85 (left to right) The phase space region x < 2π; π p < π is divided on N = 6 5 cells Chirikov typical map (969) with dissipation p = ηp + k sin(x + θ t), x = x + p θ t = θ t+t are random phases periodically repeated after T iterations, chaos border k c 25/T /2, Kolmogorov-Sinai entropy h 29k 2/ ; grid of N = N x N p cells with N c 4 trajectories which generates links (transition probabilities) from one cell to another; effective noise of cell size; maximum N = 225; 44 6 (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 2 / 2

13 Bifurcation diagram <= Bifurcation diagram showing values of p vs map parameter k for the set T The values of p, obtained from trajectories with initial random positions in the phase space region, are shown for integer moments of time < t/t (left) and 4 < t/t 4 + (right) <= Same for set T 2 (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 / 2

14 Distribution of links log Pin,out log κ 2 log κ Differential distribution of number of nodes with ingoing P in (κ) and outgoing P out(κ) links κ for sets T (left) and T 2 (right) The straight dashed lines give the algebraic fit P(κ) κ µ with the exponent µ = 86, (T, T 2) for ingoing and µ = 9, 46 (T, T 2) outgoing links Here N = 44 6 and P(κ) gives a number of nodes at a given integer number of links κ for this matrix size Blue point at κ = shows that in the whole matrix there is a significant number of nodes with zero ingoing links Typical number of nodes κ exp(ht) (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 4 / 2

15 PageRank distribution -2 (a) (b) (c) -4 log pj -2 (d) (e) (f) -4 (j/) log j log j Differential distribution of number of nodes with PageRank distribution p j for N = 4, 9 4, 6 5 and 44 6 curves, the dashed straight lines show fits p j /j β with β: 48 (b), 88 (e), 6 (f) Dashed lines in panels (a),(d) show an exponential Boltzmann decay (see text, lines are shifted in j for clarity) In panels (a),(d) the curves at large N become superimposed Panel order as in color Fig above (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 5 / 2

16 Properties of eigenvalues and eigenvectors log( λ ) ξ (a) (N/ 4 ) -6 2 (b) (c) (d) γ (a) Dependence of gap λ on Google matrix size N for few eigenstates with λ most close to, set T, α = ; (b) dependence of PAR ξ on γ = 2 ln λ for N=25, 5625, 8, 4, 44 for set T, α = ; (c) plane of eigenvalues λ for set T with their PAR ξ values shown by grayness (black/blue for minimal ξ 4, gray/light magenta for maximal ξ ; here α =, N = 44 4 ); (d) same as (c) but for set T 2 (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 6 / 2

17 Fractal Weyl law invented for open quantum systems: the number of Gamow eigenstates N γ, that have escape rates γ in a finite bandwidth γ γ b, scales as N γ (d ) where d is a fractal dimension of a strange repeller formed by obits non-escaping in future References: JSjostrand, Duke Math J 6, (99) MZworski, Not Am Math Soc 46, 9 (999) WTLu, SSridhar and MZworski, Phys Rev Lett 9, 54 (2) SNonnenmacher and MZworski, Commun Math Phys 269, (27) Quantum Chirikov standard map with absorption FBorgonovi, IGuarneri, DLS, Phys Rev A 4, 457 (99) DLS, Phys Rev E 77, 522(R) (28) Perron-Frobenius operators? (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 7 / 2

18 Fractal Weyl law for the Chirikov standard map Leonardo Ermann (CNRS, Toulouse) => poster N= x, k=7, a=2 4 2 Im(λ) Re(λ) λ = γ c = 26, K = 7 (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 8 / 2

19 Fractal Weyl law and distribution over γ dw/dγ 5 log Nγ 5 4 log N γ fractal Weyl: N γ N ν ; ν = d = γ c /(Th), γ c = T ln η theory: ν = 88; 72 numerics: ν = 85; 6 almost all states have λ = Probability distribution dw(γ)/dγ for set T, α = at N = 25 ( ), 4 (+), 44 4 (dots); W(γ) is normalized by the number of states N γ = 55N 85 with γ < 6 Inset: dependence of number of states N γ with γ < γ b on N for sets T (circles, γ b = 6) and T 2 (triangles, γ b = ); dashed lines show the fit N γ = AN ν with A = 55, ν = 85 and A = 97, ν = 6 respectively (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 9 / 2

20 Delocalization transition in α and k log ξ log ξ k α delocalization of PageRank with α and k => destruction of Google search efficiency α c 95; 85 for T; T2; α c γ c Dependence of PageRank ξ on α for set T at N = 5625 (dotted magenta), 44 4 (dotted red), 9 4 (dashed red), 64 5 (full red) and for T 2 at N = 44 4 (dotted blue), 9 4 (dashed blue), 64 5 (full blue) Inset shows dependence of ξ on k for set T at α = 99 with N = 44 4 (dotted red), 9 4 (dashed red), 6 5 (full red) (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 2 / 2

21 Summary T: α = 99, N = 6 5 k = 22 (localized, left) k = 6 (delocalized, right) popular web sites are like attractors delocalization => transition to strange attractor links between directed networks and dynamical systems delocalization transition can put in danger Google search interesting new physics of Google Matrix (Quantware group, CNRS, Toulouse) ICTP, Trieste 24/9/29 2 / 2

Ulam method and fractal Weyl law for Perron Frobenius operators

Ulam method and fractal Weyl law for Perron Frobenius operators EPJ manuscript No. (will be inserted by the editor) Ulam method and fractal Weyl law for Perron Frobenius operators L.Ermann and D.L.Shepelyansky 1 Laboratoire de Physique Théorique (IRSAMC), Université

More information

Google matrix of social networks Dima Shepelyansky (CNRS, Toulouse)

Google matrix of social networks Dima Shepelyansky (CNRS, Toulouse) Google matrix of social networks Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima 945: Nuclear physics Wigner (955) Random Matrix Theory 99: WWW, small world social networks Markov (906)

More information

Spectral properties of Google matrix

Spectral properties of Google matrix Spectral properties of Google matrix Dima Shepelyansky www.quantware.ups-tlse.fr/dima (973-984) On the history of Bohigas-Giannoni-Schmit (BGS) conjecture (906) Markov vs Wigner (955) (990) Fractal Weyl

More information

Google matrix analysis of Markov chains

Google matrix analysis of Markov chains Google matrix analysis of Markov chains Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima with L.Ermann (CNEA TANDAR), A.Chepelianskii (Orsay), K.Frahm (LPT), J.Lages (U Besancon)+MASTODONS

More information

Chirikov standard map Dima Shepelyansky

Chirikov standard map Dima Shepelyansky Chirikov standard map Dima Shepelyansky www.quantware.ups-tlse.fr/chirikov (959) Chirikov criterion (969) Classical map: p = p + K sin x x = x + p (979) Quantum map (kicked rotator): ψ = e iˆp2 /2 e ik/

More information

Turbulent flows on complex networks

Turbulent flows on complex networks Turbulent flows on complex networks Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima Collaboration: A.D.Chepelianskii, L.Ermann, B.Georgeot, O.Giraud (CNRS, France) A.O.Zhirov, O.V.Zhirov

More information

Google matrix of world trade network Leonardo Ermann and Dima Shepelyansky (CNRS, Toulouse)

Google matrix of world trade network Leonardo Ermann and Dima Shepelyansky (CNRS, Toulouse) Google matrix of world trade network Leonardo Ermann and Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima EC FET Open NADINE project * Quantware group: classical/quantum chaos, dynamical

More information

Thermoelectricity at nanoscale: theoretical models

Thermoelectricity at nanoscale: theoretical models Thermoelectricity at nanoscale: theoretical models Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima Joint work with Oleg Zhirov (BINP) Europhys. Lett. 03, 68008 (203) 2 3 3 T/Kc 4 2 0

More information

Graph Models The PageRank Algorithm

Graph 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 information

Leonardo Ermann et al. (2016), Scholarpedia, 11(11): doi: /scholarpedia revision # [link to/cite this article]

Leonardo Ermann et al. (2016), Scholarpedia, 11(11): doi: /scholarpedia revision # [link to/cite this article] Google matrix Recommander ce contenu sur G Leonardo Ermann et al. (2016), Scholarpedia, 11(11):30944. doi:10.4249/scholarpedia.30944 revision #169983 [link to/cite this article] Dr. Leonardo Ermann, Laboratorio

More information

Algebraic Representation of Networks

Algebraic 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 information

arxiv:cond-mat/ v1 29 Dec 1996

arxiv:cond-mat/ v1 29 Dec 1996 Chaotic enhancement of hydrogen atoms excitation in magnetic and microwave fields Giuliano Benenti, Giulio Casati Università di Milano, sede di Como, Via Lucini 3, 22100 Como, Italy arxiv:cond-mat/9612238v1

More information

Uncertainty and Randomization

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 information

A Note on Google s PageRank

A 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 information

Math 304 Handout: Linear algebra, graphs, and networks.

Math 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 information

Lab 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 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 information

1998: enter Link Analysis

1998: 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 information

Link Analysis. Leonid E. Zhukov

Link 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 information

Introduction 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 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 information

Dynamical thermalization in isolated quantum dots and black holes

Dynamical thermalization in isolated quantum dots and black holes Dynamical thermalization in isolated quantum dots and black holes Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima with A.R.Kolovsky (RAS Krasnoyarsk) EPL 117, 10003 (2017) Duality relation

More information

arxiv:cond-mat/ v1 3 Sep 2004

arxiv:cond-mat/ v1 3 Sep 2004 Effects of Community Structure on Search and Ranking in Information Networks Huafeng Xie 1,3, Koon-Kiu Yan 2,3, Sergei Maslov 3 1 New Media Lab, The Graduate Center, CUNY New York, NY 10016, USA 2 Department

More information

eigenvalues, markov matrices, and the power method

eigenvalues, 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 information

Link Analysis Information Retrieval and Data Mining. Prof. Matteo Matteucci

Link 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 information

ECEN 689 Special Topics in Data Science for Communications Networks

ECEN 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 information

Calculating Web Page Authority Using the PageRank Algorithm

Calculating 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 information

Data Mining and Analysis: Fundamental Concepts and Algorithms

Data Mining and Analysis: Fundamental Concepts and Algorithms Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA

More information

Application. Stochastic Matrices and PageRank

Application. 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 information

PHY411 Lecture notes Part 5

PHY411 Lecture notes Part 5 PHY411 Lecture notes Part 5 Alice Quillen January 27, 2016 Contents 0.1 Introduction.................................... 1 1 Symbolic Dynamics 2 1.1 The Shift map.................................. 3 1.2

More information

Leaking dynamical systems: a fresh view on Poincaré recurrences

Leaking dynamical systems: a fresh view on Poincaré recurrences Leaking dynamical systems: a fresh view on Poincaré recurrences Tamás Tél Eötvös University Budapest tel@general.elte.hu In collaboration with J. Schneider, Z. Neufeld, J. Schmalzl, E. G. Altmann Two types

More information

LINK ANALYSIS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS

LINK ANALYSIS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS LINK ANALYSIS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Retrieval evaluation Link analysis Models

More information

Data Mining Recitation Notes Week 3

Data 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 information

Google matrix analysis of world trade and financial networks Leonardo Ermann and Dima Shepelyansky (CNRS, Toulouse)

Google matrix analysis of world trade and financial networks Leonardo Ermann and Dima Shepelyansky (CNRS, Toulouse) Google matrix analysis of world trade and financial networks Leonardo Ermann and Dima Shepelyansky (CNRS, Toulouse) www.quantware.ups-tlse.fr/dima EC FET Open NADINE project * Quantware group: classical/quantum

More information

Randomization and Gossiping in Techno-Social Networks

Randomization and Gossiping in Techno-Social Networks Randomization and Gossiping in Techno-Social Networks Roberto Tempo CNR-IEIIT Consiglio Nazionale delle Ricerche Politecnico ditorino roberto.tempo@polito.it CPSN Social Network Layer humans Physical Layer

More information

Online Social Networks and Media. Link Analysis and Web Search

Online 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 information

Ergodicity in data assimilation methods

Ergodicity in data assimilation methods Ergodicity in data assimilation methods David Kelly Andy Majda Xin Tong Courant Institute New York University New York NY www.dtbkelly.com April 15, 2016 ETH Zurich David Kelly (CIMS) Data assimilation

More information

Convex Optimization CMU-10725

Convex Optimization CMU-10725 Convex Optimization CMU-10725 Simulated Annealing Barnabás Póczos & Ryan Tibshirani Andrey Markov Markov Chains 2 Markov Chains Markov chain: Homogen Markov chain: 3 Markov Chains Assume that the state

More information

dynamical zeta functions: what, why and what are the good for?

dynamical zeta functions: what, why and what are the good for? dynamical zeta functions: what, why and what are the good for? Predrag Cvitanović Georgia Institute of Technology November 2 2011 life is intractable in physics, no problem is tractable I accept chaos

More information

Course 495: Advanced Statistical Machine Learning/Pattern Recognition

Course 495: Advanced Statistical Machine Learning/Pattern Recognition Course 495: Advanced Statistical Machine Learning/Pattern Recognition Lecturer: Stefanos Zafeiriou Goal (Lectures): To present discrete and continuous valued probabilistic linear dynamical systems (HMMs

More information

How 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 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 information

Krylov Subspace Methods to Calculate PageRank

Krylov 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 information

ORIGINS. E.P. Wigner, Conference on Neutron Physics by Time of Flight, November 1956

ORIGINS. E.P. Wigner, Conference on Neutron Physics by Time of Flight, November 1956 ORIGINS E.P. Wigner, Conference on Neutron Physics by Time of Flight, November 1956 P.W. Anderson, Absence of Diffusion in Certain Random Lattices ; Phys.Rev., 1958, v.109, p.1492 L.D. Landau, Fermi-Liquid

More information

6.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 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 information

Introduction to Theory of Mesoscopic Systems

Introduction to Theory of Mesoscopic Systems Introduction to Theory of Mesoscopic Systems Boris Altshuler Princeton University, Columbia University & NEC Laboratories America Lecture 3 Beforehand Weak Localization and Mesoscopic Fluctuations Today

More information

IR: Information Retrieval

IR: 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 information

No class on Thursday, October 1. No office hours on Tuesday, September 29 and Thursday, October 1.

No 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 information

MATH36001 Perron Frobenius Theory 2015

MATH36001 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 information

Link Analysis Ranking

Link 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 information

arxiv: v1 [nlin.cd] 16 Jul 2010

arxiv: v1 [nlin.cd] 16 Jul 2010 Weyl law for fat fractals arxiv:7.289v [nlin.cd] 6 Jul 2 María E. Spina, Ignacio García-Mata,2 and Marcos Saraceno,3 Departamento de Física, CEA, Libertador 825, C429BP Buenos Aires, Argentina 2 COICET,

More information

Finite-Horizon Statistics for Markov chains

Finite-Horizon Statistics for Markov chains Analyzing FSDT Markov chains Friday, September 30, 2011 2:03 PM Simulating FSDT Markov chains, as we have said is very straightforward, either by using probability transition matrix or stochastic update

More information

Lecture 12: Link Analysis for Web Retrieval

Lecture 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 information

DATA MINING LECTURE 13. Link Analysis Ranking PageRank -- Random walks HITS

DATA 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 information

PageRank. Ryan Tibshirani /36-662: Data Mining. January Optional reading: ESL 14.10

PageRank. 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 information

Abstracts. Furstenberg The Dynamics of Some Arithmetically Generated Sequences

Abstracts. Furstenberg The Dynamics of Some Arithmetically Generated Sequences CHAOS AND DISORDER IN MATHEMATICS AND PHYSICS Monday 10:00-11:00 Okounkov Algebraic geometry of random surfaces 11:30-12:30 Furstenberg Dynamics of Arithmetically Generated Sequences 12:30-14:30 lunch

More information

Page rank computation HPC course project a.y

Page 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 information

Physica A 391 (2012) Contents lists available at SciVerse ScienceDirect. Physica A. journal homepage:

Physica A 391 (2012) Contents lists available at SciVerse ScienceDirect. Physica A. journal homepage: Physica A 391 (2012) 5779 5793 Contents lists available at SciVerse ScienceDirect Physica A journal homepage: www.elsevier.com/locate/physa PageRank model of opinion formation on social networks Vivek

More information

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000 Topology of evolving networks: local events and universality arxiv:cond-mat/0005085v1 [cond-mat.dis-nn] 4 May 2000 Réka Albert and Albert-László Barabási Department of Physics, University of Notre-Dame,

More information

The Google Markov Chain: convergence speed and eigenvalues

The 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 information

0.1 Naive formulation of PageRank

0.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 information

Applications to network analysis: Eigenvector centrality indices Lecture notes

Applications 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 information

Lecture 15 Perron-Frobenius Theory

Lecture 15 Perron-Frobenius Theory EE363 Winter 2005-06 Lecture 15 Perron-Frobenius Theory Positive and nonnegative matrices and vectors Perron-Frobenius theorems Markov chains Economic growth Population dynamics Max-min and min-max characterization

More information

PAGERANK PARAMETERS. Amy N. Langville. American Institute of Mathematics Workshop on Ranking Palo Alto, CA August 17th, 2010

PAGERANK PARAMETERS. Amy N. Langville. American Institute of Mathematics Workshop on Ranking Palo Alto, CA August 17th, 2010 PAGERANK PARAMETERS 100David F. Gleich 120 Amy N. Langville American Institute of Mathematics Workshop on Ranking Palo Alto, CA August 17th, 2010 Gleich & Langville AIM 1 / 21 The most important page on

More information

THEORY OF SEARCH ENGINES. CONTENTS 1. INTRODUCTION 1 2. RANKING OF PAGES 2 3. TWO EXAMPLES 4 4. CONCLUSION 5 References 5

THEORY OF SEARCH ENGINES. CONTENTS 1. INTRODUCTION 1 2. RANKING OF PAGES 2 3. TWO EXAMPLES 4 4. CONCLUSION 5 References 5 THEORY OF SEARCH ENGINES K. K. NAMBIAR ABSTRACT. Four different stochastic matrices, useful for ranking the pages of the Web are defined. The theory is illustrated with examples. Keywords Search engines,

More information

Robust PageRank: Stationary Distribution on a Growing Network Structure

Robust PageRank: Stationary Distribution on a Growing Network Structure oname manuscript o. will be inserted by the editor Robust PageRank: Stationary Distribution on a Growing etwork Structure Anna Timonina-Farkas Received: date / Accepted: date Abstract PageRank PR is a

More information

Online Social Networks and Media. Link Analysis and Web Search

Online 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 information

DYNAMICAL SYSTEMS. I Clark: Robinson. Stability, Symbolic Dynamics, and Chaos. CRC Press Boca Raton Ann Arbor London Tokyo

DYNAMICAL SYSTEMS. I Clark: Robinson. Stability, Symbolic Dynamics, and Chaos. CRC Press Boca Raton Ann Arbor London Tokyo DYNAMICAL SYSTEMS Stability, Symbolic Dynamics, and Chaos I Clark: Robinson CRC Press Boca Raton Ann Arbor London Tokyo Contents Chapter I. Introduction 1 1.1 Population Growth Models, One Population 2

More information

Clusters and Percolation

Clusters and Percolation Chapter 6 Clusters and Percolation c 2012 by W. Klein, Harvey Gould, and Jan Tobochnik 5 November 2012 6.1 Introduction In this chapter we continue our investigation of nucleation near the spinodal. We

More information

Solution of the Inverse Frobenius Perron Problem for Semi Markov Chaotic Maps via Recursive Markov State Disaggregation

Solution of the Inverse Frobenius Perron Problem for Semi Markov Chaotic Maps via Recursive Markov State Disaggregation Solution of the Inverse Frobenius Perron Problem for Semi Markov Chaotic Maps via Recursive Markov State Disaggregation Andre McDonald Council for Scientific and Industrial Research Brummeria, South Africa

More information

Local properties of PageRank and graph limits. Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands MIPT 2018

Local properties of PageRank and graph limits. Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands MIPT 2018 Local properties of PageRank and graph limits Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands MIPT 2018 Centrality in networks Network as a graph G = (V, E) Centrality

More information

Chaos, Quantum Mechanics and Number Theory

Chaos, Quantum Mechanics and Number Theory Chaos, Quantum Mechanics and Number Theory Peter Sarnak Mahler Lectures 2011 Hamiltonian Mechanics (x, ξ) generalized coordinates: x space coordinate, ξ phase coordinate. H(x, ξ), Hamiltonian Hamilton

More information

arxiv:chao-dyn/ v1 19 Jan 1993

arxiv:chao-dyn/ v1 19 Jan 1993 Symbolic dynamics II The stadium billiard arxiv:chao-dyn/9301004v1 19 Jan 1993 Kai T. Hansen Niels Bohr Institute 1 Blegdamsvej 17, DK-2100 Copenhagen Ø e-mail: khansen@nbivax.nbi.dk ABSTRACT We construct

More information

Stability and topology of scale-free networks under attack and defense strategies

Stability and topology of scale-free networks under attack and defense strategies Stability and topology of scale-free networks under attack and defense strategies Lazaros K. Gallos, Reuven Cohen 2, Panos Argyrakis, Armin Bunde 3, and Shlomo Havlin 2 Department of Physics, University

More information

Problems in hyperbolic dynamics

Problems in hyperbolic dynamics Problems in hyperbolic dynamics Current Trends in Dynamical Systems and the Mathematical Legacy of Rufus Bowen Vancouver july 31st august 4th 2017 Notes by Y. Coudène, S. Crovisier and T. Fisher 1 Zeta

More information

CHAPTER 11: REYNOLDS-STRESS AND RELATED MODELS. Turbulent Flows. Stephen B. Pope Cambridge University Press, 2000 c Stephen B. Pope y + < 1.

CHAPTER 11: REYNOLDS-STRESS AND RELATED MODELS. Turbulent Flows. Stephen B. Pope Cambridge University Press, 2000 c Stephen B. Pope y + < 1. 1/3 η 1C 2C, axi 1/6 2C y + < 1 axi, ξ > 0 y + 7 axi, ξ < 0 log-law region iso ξ -1/6 0 1/6 1/3 Figure 11.1: The Lumley triangle on the plane of the invariants ξ and η of the Reynolds-stress anisotropy

More information

Quantum Chaos and Nonunitary Dynamics

Quantum Chaos and Nonunitary Dynamics Quantum Chaos and Nonunitary Dynamics Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Phys. Lett. A 373, 320 (2009) Institute of Physics, Jagiellonian University,

More information

CS 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. 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 information

Multifractality in simple systems. Eugene Bogomolny

Multifractality in simple systems. Eugene Bogomolny Multifractality in simple systems Eugene Bogomolny Univ. Paris-Sud, Laboratoire de Physique Théorique et Modèles Statistiques, Orsay, France In collaboration with Yasar Atas Outlook 1 Multifractality Critical

More information

Quantum decay rates in chaotic scattering

Quantum decay rates in chaotic scattering Quantum decay rates in chaotic scattering S. Nonnenmacher (Saclay) + M. Zworski (Berkeley) National AMS Meeting, New Orleans, January 2007 A resonant state for the partially open stadium billiard, computed

More information

Chaotic motion. Phys 750 Lecture 9

Chaotic motion. Phys 750 Lecture 9 Chaotic motion Phys 750 Lecture 9 Finite-difference equations Finite difference equation approximates a differential equation as an iterative map (x n+1,v n+1 )=M[(x n,v n )] Evolution from time t =0to

More information

Math 331 Homework Assignment Chapter 7 Page 1 of 9

Math 331 Homework Assignment Chapter 7 Page 1 of 9 Math Homework Assignment Chapter 7 Page of 9 Instructions: Please make sure to demonstrate every step in your calculations. Return your answers including this homework sheet back to the instructor as a

More information

arxiv:cond-mat/ v1 8 Jan 2004

arxiv:cond-mat/ v1 8 Jan 2004 Multifractality and nonextensivity at the edge of chaos of unimodal maps E. Mayoral and A. Robledo arxiv:cond-mat/0401128 v1 8 Jan 2004 Instituto de Física, Universidad Nacional Autónoma de México, Apartado

More information

CPSC 540: Machine Learning

CPSC 540: Machine Learning CPSC 540: Machine Learning Mark Schmidt University of British Columbia Winter 2019 Last Time: Monte Carlo Methods If we want to approximate expectations of random functions, E[g(x)] = g(x)p(x) or E[g(x)]

More information

Monte Carlo methods in PageRank computation: When one iteration is sufficient

Monte 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 information

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time

More information

4 There are many equivalent metrics used in the literature. 5 Sometimes the definition is that for any open sets U

4 There are many equivalent metrics used in the literature. 5 Sometimes the definition is that for any open sets U 5. The binary shift 5 SYMBOLIC DYNAMICS Applied Dynamical Systems This file was processed January 7, 208. 5 Symbolic dynamics 5. The binary shift The special case r = 4 of the logistic map, or the equivalent

More information

Data Mining and Matrices

Data 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 information

Markov chains of nonlinear Markov processes and an application to a winner-takes-all model for social conformity

Markov chains of nonlinear Markov processes and an application to a winner-takes-all model for social conformity LETTER TO THE EDITOR Markov chains of nonlinear Markov processes and an application to a winner-takes-all model for social conformity T.D. Frank Center for the Ecological Study of Perception and Action,

More information

PHYSICS 210A : STATISTICAL PHYSICS HW ASSIGNMENT

PHYSICS 210A : STATISTICAL PHYSICS HW ASSIGNMENT PHYSICS 210A : STATISTICAL PHYSICS HW ASSIGNMENT #1 (1) Consider a system with K possible states i, with i {1,,K}, where the transition rate W ij between any two states is the same, with W ij = γ > 0 (a)

More information

Lie algebraic quantum control mechanism analysis

Lie algebraic quantum control mechanism analysis Lie algebraic quantum control mechanism analysis June 4, 2 Existing methods for quantum control mechanism identification do not exploit analytic features of control systems to delineate mechanism (or,

More information

An Introduction to Entropy and Subshifts of. Finite Type

An Introduction to Entropy and Subshifts of. Finite Type An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview

More information

K. Pyragas* Semiconductor Physics Institute, LT-2600 Vilnius, Lithuania Received 19 March 1998

K. Pyragas* Semiconductor Physics Institute, LT-2600 Vilnius, Lithuania Received 19 March 1998 PHYSICAL REVIEW E VOLUME 58, NUMBER 3 SEPTEMBER 998 Synchronization of coupled time-delay systems: Analytical estimations K. Pyragas* Semiconductor Physics Institute, LT-26 Vilnius, Lithuania Received

More information

Markov Chains, Random Walks on Graphs, and the Laplacian

Markov Chains, Random Walks on Graphs, and the Laplacian Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

A Glance at the Standard Map

A Glance at the Standard Map A Glance at the Standard Map by Ryan Tobin Abstract The Standard (Chirikov) Map is studied and various aspects of its intricate dynamics are discussed. Also, a brief discussion of the famous KAM theory

More information

Updating PageRank. Amy Langville Carl Meyer

Updating 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 information

On the mathematical background of Google PageRank algorithm

On 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 information

Data science with multilayer networks: Mathematical foundations and applications

Data science with multilayer networks: Mathematical foundations and applications Data science with multilayer networks: Mathematical foundations and applications CDSE Days University at Buffalo, State University of New York Monday April 9, 2018 Dane Taylor Assistant Professor of Mathematics

More information

Valerio Cappellini. References

Valerio Cappellini. References CETER FOR THEORETICAL PHYSICS OF THE POLISH ACADEMY OF SCIECES WARSAW, POLAD RADOM DESITY MATRICES AD THEIR DETERMIATS 4 30 SEPTEMBER 5 TH SFB TR 1 MEETIG OF 006 I PRZEGORZAłY KRAKÓW Valerio Cappellini

More information

arxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006

arxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006 Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v1 [physics.soc-ph] 14 Dec 2006 R. Lambiotte 1 and M. Ausloos 1 1 SUPRATECS, Université de Liège, B5 Sart-Tilman, B-4000

More information

Spreading mechanism of wave packets in one dimensional disordered Klein-Gordon chains

Spreading mechanism of wave packets in one dimensional disordered Klein-Gordon chains Spreading mechanism of wave packets in one dimensional disordered Klein-Gordon chains Haris Skokos Max Planck Institute for the Physics of Complex Systems Dresden, Germany E-mail: hskokos@pks.mpg.de URL:

More information

CPSC 540: Machine Learning

CPSC 540: Machine Learning CPSC 540: Machine Learning Mark Schmidt University of British Columbia Winter 2018 Last Time: Monte Carlo Methods If we want to approximate expectations of random functions, E[g(x)] = g(x)p(x) or E[g(x)]

More information