Perron Frobenius Theory

Similar documents
MATH36001 Perron Frobenius Theory 2015

MAA704, Perron-Frobenius theory and Markov chains.

Invertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices

Markov Chains, Random Walks on Graphs, and the Laplacian

Convex Optimization CMU-10725

Notes on Linear Algebra and Matrix Theory

Z-Pencils. November 20, Abstract

Language Acquisition and Parameters: Part II

Eigenvectors Via Graph Theory

Markov Chains and Stochastic Sampling

Nonnegative and spectral matrix theory Lecture notes

An estimation of the spectral radius of a product of block matrices

Markov Chains, Stochastic Processes, and Matrix Decompositions

On the convergence of weighted-average consensus

Two Characterizations of Matrices with the Perron-Frobenius Property

Lecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?

1.3 Convergence of Regular Markov Chains

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with

Section 1.7: Properties of the Leslie Matrix

A linear model for a ranking problem

Spectral radius, symmetric and positive matrices

Necessary and sufficient conditions for strong R-positivity

Section 3.9. Matrix Norm

Calculating Web Page Authority Using the PageRank Algorithm

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES

Geometric Mapping Properties of Semipositive Matrices

Finite-Horizon Statistics for Markov chains

The Perron-Frobenius Theorem and its Application to Population Dynamics

Introduction to Machine Learning CMU-10701

Math Camp Notes: Linear Algebra II

8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains

The spectrum of a square matrix A, denoted σ(a), is the multiset of the eigenvalues

Discrete Math Class 19 ( )

Affine iterations on nonnegative vectors

Some bounds for the spectral radius of the Hadamard product of matrices

On Distributed Coordination of Mobile Agents with Changing Nearest Neighbors

A note on estimates for the spectral radius of a nonnegative matrix

Algebra Exam Topics. Updated August 2017

Social network analysis: social learning

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

Probability & Computing

Link Analysis. Leonid E. Zhukov

Permutation transformations of tensors with an application

NOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES

Eigenvalues in Applications

Krylov Subspace Methods to Calculate PageRank

Properties of Matrices and Operations on Matrices

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

Chapter 7 Special matrices

Key words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013

NCS Lecture 8 A Primer on Graph Theory. Cooperative Control Applications

Statistics 992 Continuous-time Markov Chains Spring 2004

Information Theory. Lecture 5 Entropy rate and Markov sources STEFAN HÖST

Scientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1

Spectral Properties of Matrix Polynomials in the Max Algebra

On the simultaneous diagonal stability of a pair of positive linear systems

BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION

6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities

Perron-Frobenius theorem for nonnegative multilinear forms and extensions

Graph Models The PageRank Algorithm

Wavelets and Linear Algebra

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

On the spectra of striped sign patterns

On the mathematical background of Google PageRank algorithm

Lecture 5: Random Walks and Markov Chain

Primitive Digraphs with Smallest Large Exponent

Detailed Proof of The PerronFrobenius Theorem

Eigenvalue Comparisons for Boundary Value Problems of the Discrete Beam Equation

Lecture 2: September 8

Stochastic modelling of epidemic spread

eigenvalues, markov matrices, and the power method

Lecture 15 Perron-Frobenius Theory

Eigenvalues of the Adjacency Tensor on Products of Hypergraphs

Some bounds for the spectral radius of the Hadamard product of matrices

The Perron Frobenius theorem and the Hilbert metric

Theory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk

SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices)

Nonlinear equations. Norms for R n. Convergence orders for iterative methods

Lecture: Local Spectral Methods (1 of 4)

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1

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

The Perron Frobenius Theorem and a Few of Its Many Applications

The Miracles of Tropical Spectral Theory

Perron Frobenius Theory of Nonnegative Matrices

LinGloss. A glossary of linear algebra

Note that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < +

Markov Chains. As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006.

Consensus of Information Under Dynamically Changing Interaction Topologies

Introduction to Search Engine Technology Introduction to Link Structure Analysis. Ronny Lempel Yahoo Labs, Haifa

Lecture 4: Introduction to Graph Theory and Consensus. Cooperative Control Applications

arxiv: v1 [math.fa] 19 Jul 2009

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Applications of The Perron-Frobenius Theorem

Definition A finite Markov chain is a memoryless homogeneous discrete stochastic process with a finite number of states.

Matrix analytic methods. Lecture 1: Structured Markov chains and their stationary distribution

Stochastic modelling of epidemic spread

Applications to network analysis: Eigenvector centrality indices Lecture notes

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY

Understanding MCMC. Marcel Lüthi, University of Basel. Slides based on presentation by Sandro Schönborn

Transcription:

Perron Frobenius Theory Oskar Perron Georg Frobenius (1880 1975) (1849 1917) Stefan Güttel Perron Frobenius Theory 1 / 10

Positive and Nonnegative Matrices Let A, B R m n. A B if a ij b ij i, j, A > B if a ij > b ij i, j, A is nonnegative if A 0, A is positive if A > 0. Stefan Güttel Perron Frobenius Theory 2 / 10

Positive and Nonnegative Matrices Let A, B R m n. A B if a ij b ij i, j, A > B if a ij > b ij i, j, A is nonnegative if A 0, A is positive if A > 0. Stefan Güttel Perron Frobenius Theory 2 / 10

What about the eigenvalues of A 0? Spectral radius: ρ(a) = max{ λ : λ is an eigenvalue of A}. Theorem (Nonnegative eigenpairs, Thm. 1) If A 0 then ρ(a) is an eigenvalue of A and there exists an associated eigenvector x 0 such that Ax = ρ(a)x. Stefan Güttel Perron Frobenius Theory 3 / 10

What about the eigenvalues of A 0? Spectral radius: ρ(a) = max{ λ : λ is an eigenvalue of A}. Theorem (Nonnegative eigenpairs, Thm. 1) If A 0 then ρ(a) is an eigenvalue of A and there exists an associated eigenvector x 0 such that Ax = ρ(a)x. The following lemma is a consequence of Theorem 1. Lemma (Lem. 2) Let A 0. Then I A is nonsingular and (I A) 1 0 if and only if ρ(a) < 1. Stefan Güttel Perron Frobenius Theory 3 / 10

Positive Matrices Theorem (Perron s theorem, Thm. 3) If A R n n and A > 0 then (i) ρ(a) > 0. (ii) ρ(a) is an e val of A. (iii) There is an e vec x with x > 0 and Ax = ρ(a) x. (iv) The e val ρ(a) has algebraic multiplicity 1. (v) All the other e vals are less than ρ(a) in absolute value, i.e., ρ(a) is the only e val of maximum modulus. (Proof not examinable.) Stefan Güttel Perron Frobenius Theory 4 / 10

Powers of positive matrices Theorem (Thm. 4) If A > 0, x is any positive e vec of A corresponding to ρ(a), and y is any positive e vec of A T corresponding to ρ(a) = ρ(a T ) then ( ) k A lim = xy T k ρ(a) y T x > 0. Stefan Güttel Perron Frobenius Theory 5 / 10

Irreducible Nonnegative Matrices Most properties in Perron s Thm are lost for A 0 unless A R n n is irreducible (i.e., not reducible). A R n n is reducible if there exists a permutation matrix P s.t. [ ] X Y P T AP =, 0 Z where X and Z are both square. Stefan Güttel Perron Frobenius Theory 6 / 10

Irreducible Nonnegative Matrices Most properties in Perron s Thm are lost for A 0 unless A R n n is irreducible (i.e., not reducible). A R n n is reducible if there exists a permutation matrix P s.t. [ ] X Y P T AP =, 0 Z where X and Z are both square. Directed graph of A R n n : connects n pts P 1,..., P n by a direct link from P i to P j if a ij 0. Stefan Güttel Perron Frobenius Theory 6 / 10

Irreducible Nonnegative Matrices Most properties in Perron s Thm are lost for A 0 unless A R n n is irreducible (i.e., not reducible). A R n n is reducible if there exists a permutation matrix P s.t. [ ] X Y P T AP =, 0 Z where X and Z are both square. Directed graph of A R n n : connects n pts P 1,..., P n by a direct link from P i to P j if a ij 0. Strongly connected graph: for any 2 pts P i and P j, a finite sequence of directed links from P i to P j. Stefan Güttel Perron Frobenius Theory 6 / 10

Irreducible Nonnegative Matrices Most properties in Perron s Thm are lost for A 0 unless A R n n is irreducible (i.e., not reducible). A R n n is reducible if there exists a permutation matrix P s.t. [ ] X Y P T AP =, 0 Z where X and Z are both square. Directed graph of A R n n : connects n pts P 1,..., P n by a direct link from P i to P j if a ij 0. Strongly connected graph: for any 2 pts P i and P j, a finite sequence of directed links from P i to P j. Fact A 0 is irreducible if and only if its directed graph is strongly connected. Stefan Güttel Perron Frobenius Theory 6 / 10

Perron Frobenius theorem Theorem (Thm.5) If A 0 is irreducible then (i) ρ(a) > 0. (ii) ρ(a) is an e val of A. (iii) There is an e vec x with x > 0 and Ax = ρ(a) x. (iv) ρ(a) is an e val of algebraic multiplicity 1. Stefan Güttel Perron Frobenius Theory 7 / 10

Perron Frobenius theorem Theorem (Thm.5) If A 0 is irreducible then (i) ρ(a) > 0. (ii) ρ(a) is an e val of A. (iii) There is an e vec x with x > 0 and Ax = ρ(a) x. (iv) ρ(a) is an e val of algebraic multiplicity 1. λ max (A) = ρ(a) is called the Perron root. The Perron vector is the unique vector p defined by Ap = ρ(a)p, p > 0, p 1 = 1. Stefan Güttel Perron Frobenius Theory 7 / 10

Stochastic Matrices P R n n is a stochastic matrix if P 0 and each row sum is equal to 1, i.e., 1 n p ij = 1, i = 1, 2,..., n Pe = e, e = 1.. j=1 1 Stefan Güttel Perron Frobenius Theory 8 / 10

Stochastic Matrices P R n n is a stochastic matrix if P 0 and each row sum is equal to 1, i.e., 1 n p ij = 1, i = 1, 2,..., n Pe = e, e = 1.. j=1 1 Hence λ = 1 is an e val of P. Stefan Güttel Perron Frobenius Theory 8 / 10

Stochastic Matrices P R n n is a stochastic matrix if P 0 and each row sum is equal to 1, i.e., 1 n p ij = 1, i = 1, 2,..., n Pe = e, e = 1.. j=1 1 Hence λ = 1 is an e val of P. Also, ρ(p) P = max 1 i n n p ij = 1 so ρ(p) = 1. j=1 Stefan Güttel Perron Frobenius Theory 8 / 10

Stochastic Matrices P R n n is a stochastic matrix if P 0 and each row sum is equal to 1, i.e., 1 n p ij = 1, i = 1, 2,..., n Pe = e, e = 1.. j=1 1 Hence λ = 1 is an e val of P. Also, ρ(p) P = max 1 i n n p ij = 1 so ρ(p) = 1. j=1 In Markov chains P is called a transition matrix. A probability distribution vector is a vector p 0 s.t. e T p = 1 n i=1 p i = 1. Stefan Güttel Perron Frobenius Theory 8 / 10

Markov Chains Let p (0) be a given probability distribution vector. We want to know the behaviour of p (k) = P T p (k 1) = = (P T ) k p (0) as k. Stefan Güttel Perron Frobenius Theory 9 / 10

Markov Chains Let p (0) be a given probability distribution vector. We want to know the behaviour of p (k) = P T p (k 1) = = (P T ) k p (0) as k. Theorem (Thm.7) If P > 0 stochastic then lim k p (k) = p independently of p (0), where p 0 satisfies P T p = p, e T p = 1. Stefan Güttel Perron Frobenius Theory 9 / 10

Markov Chains Let p (0) be a given probability distribution vector. We want to know the behaviour of p (k) = P T p (k 1) = = (P T ) k p (0) as k. Theorem (Thm.7) If P > 0 stochastic then lim k p (k) = p independently of p (0), where p 0 satisfies P T p = p, e T p = 1. Proof: P stochastic ρ(p) = 1 and Pe = e. Thm.4 applied to P T > 0 with x = p and y = e gives lim k p(k) = lim (P T ) k p (0) = pet k e T p p(0) = et p (0) e T p p = p since e T p (0) = e T p = 1. Stefan Güttel Perron Frobenius Theory 9 / 10

Example 3 Let Q = (q ij ) > 0, where q ij = fraction of commodity present in region R j and ship to region R i, i, j = 1,..., n. Suppose there are x i units in region R i today with n i=1 x i = α. Q k x = distribution of commodity k days from today. Distribution of the commodity far in the future? Stefan Güttel Perron Frobenius Theory 10 / 10

Example 3 Let Q = (q ij ) > 0, where q ij = fraction of commodity present in region R j and ship to region R i, i, j = 1,..., n. Suppose there are x i units in region R i today with n i=1 x i = α. Q k x = distribution of commodity k days from today. Distribution of the commodity far in the future? 0.1 0.2 0.1 0.1 Q = 0.7 0.6 0.1 0.1 0.1 0.1 0.7 0.1 > 0, QT e = e Q stochastic. 0.1 0.1 0.1 0.7 Stefan Güttel Perron Frobenius Theory 10 / 10

Example 3 Let Q = (q ij ) > 0, where q ij = fraction of commodity present in region R j and ship to region R i, i, j = 1,..., n. Suppose there are x i units in region R i today with n i=1 x i = α. Q k x = distribution of commodity k days from today. Distribution of the commodity far in the future? 0.1 0.2 0.1 0.1 Q = 0.7 0.6 0.1 0.1 0.1 0.1 0.7 0.1 > 0, QT e = e Q stochastic. 0.1 0.1 0.1 0.7 Thm.7 with p (0) = x/α lim k αq k (x/α) = αp with p 0 s.t. Qp = p, e T p = 1. Limit depends only on α and Q and not on x. Stefan Güttel Perron Frobenius Theory 10 / 10

Example 3 Let Q = (q ij ) > 0, where q ij = fraction of commodity present in region R j and ship to region R i, i, j = 1,..., n. Suppose there are x i units in region R i today with n i=1 x i = α. Q k x = distribution of commodity k days from today. Distribution of the commodity far in the future? 0.1 0.2 0.1 0.1 Q = 0.7 0.6 0.1 0.1 0.1 0.1 0.7 0.1 > 0, QT e = e Q stochastic. 0.1 0.1 0.1 0.7 Thm.7 with p (0) = x/α lim k αq k (x/α) = αp with p 0 s.t. Qp = p, e T p = 1. Limit depends only on α and Q and not on x. Verify that p = [ 6 16 11 11 ] T /44. Stefan Güttel Perron Frobenius Theory 10 / 10