The Distribution of the Minimum of Independent Phase Type Random Variables
|
|
- Scot Stanley
- 5 years ago
- Views:
Transcription
1 The Distribution of the Minimum of Independent Phase Type Random Variables Darcy Bermingham, supervised by Yoni Nazarathy The University of Queensland School of Mathematics and Physics December 215 In this short note we illustrate the well known property, that the minimum of independent phase type random variables is also a phase type random variable We give both an algebraic and a probabilistic proof, and illustrate these graphically A phase type (P H) random variable, with parameters R n and T R n n, such that 1 1, is a hitting time τ : inf{t > : X (t) n + 1}, where X (t) is Markov process on {1,, n + 1}, with generator, ( ) T η Q Here is the initial distribution over the states {1,, n}, η T 1 and 1 is a column vector of ones of appropriate length It has the CDF P (τ t) 1 e T t 1 (1) where e T t is the matrix exponential We now have the following Theorem: Let Z i for i 1, 2,, k be independent P H( i, T i ) random variables of order n i Then Z : min(z 1,, Z k ) P H(, T ) of order Π k i1 n i where 1 2 k, T T 1 T 2 T k, where for matrices, A R r s and B R p q the Kronecker product,, and Kronecker sum,, are respectively defined by: a 11 B a 1n B A B R r p s q, a m1 B a mn B with I s denoting the s s identity matrix A B A I p + I r B, Proof: First consider the case where k 2 Let the corresponding Markov process of Z 1 and Z 2 be X 1 and X 2, then consider a Markov process X with state space S {(i, j) 1 i m, 1 j n} {} where is the absorbing state We denote the transition rates λ i,j T 1 i,j and µ i,j T 2 i,j X is X 1 and X 2 running simultaneously, reaching once one of the processes reaches its absorbing state Since the processes are independent, the probability that X () is in state (i, j) is i 1 2 j So if the states 1
2 are ordered as in the matrix in Figure 3, it is easy to see that 1 2 gives the initial distribution over states The only possible transitions in X are i, k From To Rate Induced by (i,j) (h,j) λ i,h X 1 (i,j) (i,k) µ j,k X 2 (i,j) () λ i, + µ j, X 1 or X 2 q i,j µ j,k µ k,j i, j µ j, λ i, λ i,h λ h,i h, j i,j Figure 1: Transitions of state (i, j) and so the total rate out of state (i, j), denoted, q i,j is h i λ i,h + k j µ j,k + λ i, + µ j, Denote the transition rate (i, j) as η i,j The process can be visualized more generally as follows: η 1,n m,n X2 Transitions 1,1 m,1 X 1 Transitions Figure 2: Possible Transitions in S (See Figure 6 for example) Writing this out in matrix form yields the generator matrix on page 3, from which it is easy to see why the Kronecker sum gives rise to the generator T of the minimum phase type distribution (upper left sections of the matrix) More particularly notice that η i,j T 1 q i,j (i,j) T (i,j) (h,k) q 1 i + q 2 j h i λ i,h k j µ j,k 2
3 λ i,h + λ i, + µ j,k + µ j, λ i,h µ j,k λ i, + µ j, h i k j h i k j (1,1) (1,2) (1,n) (2,1) (2,2) (2,n) (m,1) (m,2) (m,n) () (1,1) q 1,1 µ 1,2 µ 1,n λ 1,2 λ 1,m η 1,1 (1,2) µ 2,1 q 1,2 µ 2,n λ 1,2 λ 1,m η 1,2 (1,n) µ n,1 µ n,2 q 1,n λ 1,2 λ 1,m η 1,n (2,1) λ 2,1 q 2,1 µ 1,2 µ 1,n λ 2,m η 2,1 (2,2) λ 2,1 µ 2,1 q 2,2 µ 2,n λ 2,m η 2,2 (2,n) λ 2,1 µ n,1 µ n,2 q 2,n λ 2,m η 2,n (m,1) λ m,1 λ m,2 q m,1 µ 1,2 µ 1,n η m,1 (m,2) λ m,1 λ m,2 µ 2,1 q m,2 µ 2,n η m,2 (m,n) λ m,1 λ m,2 µ n,1 µ n,2 q m,n η m,n () Figure 3: Generator of the minimum distribution Before the algebraic proof for k 2, we will show that e T t e St e (T S)t, (2) where T is a square matrix of order m and S is a square matrix of order n Here the mixed product property of the Kronecker product (AB) (CD) (A C)(B D), and the left-distributive property A (B + C) A B + A C will be used By definition of the matrix exponential, e T t e St (tt ) r (ts) l r! l! r l t l+r T r S l by the left distributive property r!l! r l v t v T v l S l see figure 4 (v l)!l! v l t v v v!t v l S l v! (v l)!l! v l t v v ( ) v (T v l I v! l m) l (In v l S l ) v l t v v ( ) v (T v l In v l )(Im l S l ) by the mixed product property v! l v l t v v ( ) v (T I n ) v l (I m S) l by the mixed product property v! l v l 3
4 t v v! (T I n + I m S) v by the binomial theorem v e (T S)t by definition The binomial theorem can be applied because the matrices (T I n ) v l and (I m S) l are commutative, noting that T v l S l (I l mt v l ) (S l I v l n ) (I l m S l )(T v l I v l n ) (I m S) l (T I n ) v l (T I n ) v l (I m S) l Completing the proof, P(min(Z 1, Z 2 ) > t) P(Z 1 > t)p(z 2 > t) by independence ( 1 e T 1t 1 m )( 2 e T 2t 1 n ) by (1) ( 1 e T 1t 1 m ) ( 2 e T 2t 1 n ) 1 1 matrices ( 1 2 )(e T 1t e T 2t )(1 m 1 n ) mixed product property ( 1 2 )(e (T 1 T 2 )t )1 mn by (2) which, by (1), is a phase type distribution with parameters 1 2 and T 1 T 2 r l v v 1 v 2 Figure 4: Double Summation Change of Variables To prove for all k 2, assume that the theorem is true for k p So, min(z 1, Z 2,, Z p ) P H ( p, T p ) where p 1 2 p and T p T 1 T 2 T p Now min(z 1, Z 2,, Z p, Z p+1 ) min(min(z 1, Z 2,, Z p ), Z p+1 ) which, given the assumption, is distributed P H( p p+1, T p T p+1 ) by the same reasoning as either of the proofs for k 2 QED 4
5 Example 1: Minimum of Two Generalised Erlang (Hypoexponential) Random Variables A Generalised Erlang random variable is defined as m k1 X k where the X k are independent exponential random variables with rate λ k So it is P H distributed with parameters [1 ] R m and λ 1,2 λ 1,2 λ 2,3 λ 2,3 T λ m 1,m λ m 1,m λ m, and can be visualised as follows: λ 1,2 λ 2,3 λ m 1,m λ m, 1 2 m Figure 5: Single Hypoexponential P H distribution So let the above Markov process be X 1, and let X 2 also be a Generalised Erlang of dimension n and rates µ k Then, the two processes running at the same time can be represented as in figure 5 below µn, µn, µn, µ n, + λ m, λ 1,2 1,n 2,n λ 2,3 λ m 1,m m,n µm 1,m µm 1,m µ2,3 µ2,3 µ2,3 µm 1,m λ m, 1,2 λ 1,2 2,2 λ 2,3 λ m 1,m m,2 λ m, µ1,2 µ1,2 µ1,2 1,1 λ 1,2 2,1 λ 2,3 λ m 1,m m,1 λ m, Figure 6: State Space and Transitions for Minimum of Two Hypoexponentials 5
6 Example 2: Minimum of Two Hyper-exponential Random Variables A hyper-exponential random variable is a mixture of n exponential random variables X i for i 1,, n, with rates λ i and weights p i It is a phase type random variable and in the case when n 2, its parameters are [ ] λ1 [p 1 p] T λ 2 Take another hyper-exponential random variable, with n 2, weights q and 1 q and rates µ i By applying the theorem, the parameters of the P H distribution of the minimum of the two random variables are 1 2 [pq p(1 q) (1 p)q (1 p)(1 q)] T (1,1) (1,2) (2,1) (2,2) (1,1) (λ 1 + µ 1 ) (1,2) (λ 1 + µ 2 ) (2,1) (λ 2 + µ 1 ) (2,2) (λ 2 + µ 2 ) where all empty elements of the T matrix are Note that this is also a hyper-exponential distribution (1 p)(1 q) 2,2 λ 2 + µ 2 (1 p)q 2,1 λ 2 + µ 1 p(1 q) 1,2 λ 1 + µ 2 pq 1,1 λ 1 + µ 1 Figure 7: Hyper-exponential Representation of the Minimum 6
Determinants - Uniqueness and Properties
Determinants - Uniqueness and Properties 2-2-2008 In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations
More informationMatrix Multiplication
3.2 Matrix Algebra Matrix Multiplication Example Foxboro Stadium has three main concession stands, located behind the south, north and west stands. The top-selling items are peanuts, hot dogs and soda.
More informationLimit Laws for Random Matrices from Traffic Probability
Limit Laws for Random Matrices from Traffic Probability arxiv:1601.02188 Slides available at math.berkeley.edu/ bensonau Benson Au UC Berkeley May 9th, 2016 Benson Au (UC Berkeley) Random Matrices from
More informationChapter Learning Objectives. Probability Distributions and Probability Density Functions. Continuous Random Variables
Chapter 4: Continuous Random Variables and Probability s 4-1 Continuous Random Variables 4-2 Probability s and Probability Density Functions 4-3 Cumulative Functions 4-4 Mean and Variance of a Continuous
More informationLimits and Continuity
Limits and Continuity Notes by Walter Noll, 1991 1 Real Sequences, Convergence Let an index set I be given. The set R I of all real families indexed on I has the natural structure of a commutative ring
More informationECS 178 Course Notes QUATERNIONS
ECS 178 Course Notes QUATERNIONS Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview The quaternion number system was discovered
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationStage-structured Populations
Department of Biology New Mexico State University Las Cruces, New Mexico 88003 brook@nmsu.edu Fall 2009 Age-Structured Populations All individuals are not equivalent to each other Rates of survivorship
More information7-7 Multiplying Polynomials
Example 1: Multiplying Monomials A. (6y 3 )(3y 5 ) (6y 3 )(3y 5 ) (6 3)(y 3 y 5 ) 18y 8 Group factors with like bases together. B. (3mn 2 ) (9m 2 n) Example 1C: Multiplying Monomials Group factors with
More informationLinear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations
More informationChapter 3: Markov Processes First hitting times
Chapter 3: Markov Processes First hitting times L. Breuer University of Kent, UK November 3, 2010 Example: M/M/c/c queue Arrivals: Poisson process with rate λ > 0 Example: M/M/c/c queue Arrivals: Poisson
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationMathematical Preliminaries
Mathematical Preliminaries Introductory Course on Multiphysics Modelling TOMAZ G. ZIELIŃKI bluebox.ippt.pan.pl/ tzielins/ Table of Contents Vectors, tensors, and index notation. Generalization of the concept
More informationCHAPTER XV. Exponential algebra
CHAPTER XV Exponential algebra 15.1. Introduction. We develop some elementary features of the intricate and hyperintricate exponential algebra and in particular the bosonic and fermionic Euler relations
More informationICS141: Discrete Mathematics for Computer Science I
ICS4: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationLinear Algebra Solutions 1
Math Camp 1 Do the following: Linear Algebra Solutions 1 1. Let A = and B = 3 8 5 A B = 3 5 9 A + B = 9 11 14 4 AB = 69 3 16 BA = 1 4 ( 1 3. Let v = and u = 5 uv = 13 u v = 13 v u = 13 Math Camp 1 ( 7
More informationVectors and Matrices Notes.
Vectors and Matrices Notes Jonathan Coulthard JonathanCoulthard@physicsoxacuk 1 Index Notation Index notation may seem quite intimidating at first, but once you get used to it, it will allow us to prove
More informationRecursive Calculation of Finite Time Ruin Probabilities Under Interest Force
Recursive Calculation of Finite Time Ruin Probabilities Under Interest Force Rui M R Cardoso and Howard R Waters Abstract In this paper we consider a classical insurance surplus process affected by a constant
More informationMatrices BUSINESS MATHEMATICS
Matrices BUSINESS MATHEMATICS 1 CONTENTS Matrices Special matrices Operations with matrices Matrix multipication More operations with matrices Matrix transposition Symmetric matrices Old exam question
More informationMatrices over Hyperbolic Split Quaternions
Filomat 30:4 (2016), 913 920 DOI 102298/FIL1604913E Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Matrices over Hyperbolic Split
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationMatrices and Determinants
Chapter1 Matrices and Determinants 11 INTRODUCTION Matrix means an arrangement or array Matrices (plural of matrix) were introduced by Cayley in 1860 A matrix A is rectangular array of m n numbers (or
More informationOn Expected Gaussian Random Determinants
On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose
More informationMatrix representation of a linear map
Matrix representation of a linear map As before, let e i = (0,..., 0, 1, 0,..., 0) T, with 1 in the i th place and 0 elsewhere, be standard basis vectors. Given linear map f : R n R m we get n column vectors
More information1 Linear transformations; the basics
Linear Algebra Fall 2013 Linear Transformations 1 Linear transformations; the basics Definition 1 Let V, W be vector spaces over the same field F. A linear transformation (also known as linear map, or
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationVector, Matrix, and Tensor Derivatives
Vector, Matrix, and Tensor Derivatives Erik Learned-Miller The purpose of this document is to help you learn to take derivatives of vectors, matrices, and higher order tensors (arrays with three dimensions
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationThis operation is - associative A + (B + C) = (A + B) + C; - commutative A + B = B + A; - has a neutral element O + A = A, here O is the null matrix
1 Matrix Algebra Reading [SB] 81-85, pp 153-180 11 Matrix Operations 1 Addition a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn + b 11 b 12 b 1n b 21 b 22 b 2n b m1 b m2 b mn a 11 + b 11 a 12 + b 12 a 1n
More informationKevin James. MTHSC 3110 Section 2.1 Matrix Operations
MTHSC 3110 Section 2.1 Matrix Operations Notation Let A be an m n matrix, that is, m rows and n columns. We ll refer to the entries of A by their row and column indices. The entry in the i th row and j
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More informationHidden Markov Models,99,100! Markov, here I come!
Hidden Markov Models,99,100! Markov, here I come! 16.410/413 Principles of Autonomy and Decision-Making Pedro Santana (psantana@mit.edu) October 7 th, 2015. Based on material by Brian Williams and Emilio
More informationSequence labeling. Taking collective a set of interrelated instances x 1,, x T and jointly labeling them
HMM, MEMM and CRF 40-957 Special opics in Artificial Intelligence: Probabilistic Graphical Models Sharif University of echnology Soleymani Spring 2014 Sequence labeling aking collective a set of interrelated
More informationPhys 201. Matrices and Determinants
Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1
More informationMatrix & Linear Algebra
Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A
More informationMatrix Multiplication
228 hapter Three Maps etween Spaces IV2 Matrix Multiplication After representing addition and scalar multiplication of linear maps in the prior subsection, the natural next operation to consider is function
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationMTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)
MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018) COURSEWORK 3 SOLUTIONS Exercise ( ) 1. (a) Write A = (a ij ) n n and B = (b ij ) n n. Since A and B are diagonal, we have a ij = 0 and
More informationPreviously Monte Carlo Integration
Previously Simulation, sampling Monte Carlo Simulations Inverse cdf method Rejection sampling Today: sampling cont., Bayesian inference via sampling Eigenvalues and Eigenvectors Markov processes, PageRank
More informationChapter 1 Matrices and Systems of Equations
Chapter 1 Matrices and Systems of Equations System of Linear Equations 1. A linear equation in n unknowns is an equation of the form n i=1 a i x i = b where a 1,..., a n, b R and x 1,..., x n are variables.
More informationAssignment 2.1. Exponent Properties: The Product Rule
Assignment.1 NAME: Exponent Properties: The Product Rule What is the difference between x and x? Explain in complete sentences and with examples. Product Repeated Multiplication Power of the form a b 5
More informationMatrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices
Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J Olver 3 Review of Matrix Algebra Vectors and matrices are essential for modern analysis of systems of equations algebrai, differential, functional, etc In this
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationICS 6N Computational Linear Algebra Matrix Algebra
ICS 6N Computational Linear Algebra Matrix Algebra Xiaohui Xie University of California, Irvine xhx@uci.edu February 2, 2017 Xiaohui Xie (UCI) ICS 6N February 2, 2017 1 / 24 Matrix Consider an m n matrix
More informationMath review. Math review
Math review 1 Math review 3 1 series approximations 3 Taylor s Theorem 3 Binomial approximation 3 sin(x), for x in radians and x close to zero 4 cos(x), for x in radians and x close to zero 5 2 some geometry
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More informationMarkov 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 informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationMatrices. 1 a a2 1 b b 2 1 c c π
Matrices 2-3-207 A matrix is a rectangular array of numbers: 2 π 4 37 42 0 3 a a2 b b 2 c c 2 Actually, the entries can be more general than numbers, but you can think of the entries as numbers to start
More informationChapter 7: Exponents
Chapter : Exponents Algebra Chapter Notes Name: Notes #: Sections.. Section.: Review Simplify; leave all answers in positive exponents:.) m -.) y -.) m 0.) -.) -.) - -.) (m ) 0.) 0 x y Evaluate if a =
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistical Sciences! rsalakhu@cs.toronto.edu! h0p://www.cs.utoronto.ca/~rsalakhu/ Lecture 7 Approximate
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationChapter XI Novanion rings
Chapter XI Novanion rings 11.1 Introduction. In this chapter we continue to provide general structures for theories in physics. J. F. Adams proved in 1960 that the only possible division algebras are at
More informationAnnouncements Wednesday, October 10
Announcements Wednesday, October 10 The second midterm is on Friday, October 19 That is one week from this Friday The exam covers 35, 36, 37, 39, 41, 42, 43, 44 (through today s material) WeBWorK 42, 43
More informationOptimal Preconditioning for the Interval Parametric Gauss Seidel Method
Optimal Preconditioning for the Interval Parametric Gauss Seidel Method Milan Hladík Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic http://kam.mff.cuni.cz/~hladik/ SCAN,
More informationA Divide-and-Conquer Algorithm for Functions of Triangular Matrices
A Divide-and-Conquer Algorithm for Functions of Triangular Matrices Ç. K. Koç Electrical & Computer Engineering Oregon State University Corvallis, Oregon 97331 Technical Report, June 1996 Abstract We propose
More informationAnnouncements Monday, October 02
Announcements Monday, October 02 Please fill out the mid-semester survey under Quizzes on Canvas WeBWorK 18, 19 are due Wednesday at 11:59pm The quiz on Friday covers 17, 18, and 19 My office is Skiles
More informationLecture 11. Linear systems: Cholesky method. Eigensystems: Terminology. Jacobi transformations QR transformation
Lecture Cholesky method QR decomposition Terminology Linear systems: Eigensystems: Jacobi transformations QR transformation Cholesky method: For a symmetric positive definite matrix, one can do an LU decomposition
More informationLearning Sequence Motif Models Using Expectation Maximization (EM) and Gibbs Sampling
Learning Sequence Motif Models Using Expectation Maximization (EM) and Gibbs Sampling BMI/CS 776 www.biostat.wisc.edu/bmi776/ Spring 009 Mark Craven craven@biostat.wisc.edu Sequence Motifs what is a sequence
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationDot Products, Transposes, and Orthogonal Projections
Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +
More informationLECTURE 16: LIE GROUPS AND THEIR LIE ALGEBRAS. 1. Lie groups
LECTURE 16: LIE GROUPS AND THEIR LIE ALGEBRAS 1. Lie groups A Lie group is a special smooth manifold on which there is a group structure, and moreover, the two structures are compatible. Lie groups are
More informationSolving Dynamic Equations: The State Transition Matrix
Overview Solving Dynamic Equations: The State Transition Matrix EGR 326 February 24, 2017 Solutions to coupled dynamic equations Solutions to dynamic circuits from EGR 220 The state transition matrix Discrete
More informationChapter 2: Markov Chains and Queues in Discrete Time
Chapter 2: Markov Chains and Queues in Discrete Time L. Breuer University of Kent 1 Definition Let X n with n N 0 denote random variables on a discrete space E. The sequence X = (X n : n N 0 ) is called
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More informationFunctional determinants
Functional determinants based on S-53 We are going to discuss situations where a functional determinant depends on some other field and so it cannot be absorbed into the overall normalization of the path
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationIntroduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim
Introduction - Motivation Many phenomena (physical, chemical, biological, etc.) are model by differential equations. Recall the definition of the derivative of f(x) f f(x + h) f(x) (x) = lim. h 0 h Its
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
More informationEXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices
/ rings definitions and elementary properties 171 EXERCISES A. Examples of Rings In each of the following, a set A with operations of addition and multiplication is given. Prove that A satisfies all the
More informationStochastic Processes
MTHE/STAT455, STAT855 Fall 202 Stochastic Processes Final Exam, Solutions (5 marks) (a) (0 marks) Condition on the first pair to bond; each of the n adjacent pairs is equally likely to bond Given that
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationIntroduction to the Tensor Train Decomposition and Its Applications in Machine Learning
Introduction to the Tensor Train Decomposition and Its Applications in Machine Learning Anton Rodomanov Higher School of Economics, Russia Bayesian methods research group (http://bayesgroup.ru) 14 March
More informationCalculus II - Basic Matrix Operations
Calculus II - Basic Matrix Operations Ryan C Daileda Terminology A matrix is a rectangular array of numbers, for example 7,, 7 7 9, or / / /4 / / /4 / / /4 / /6 The numbers in any matrix are called its
More informationDeterminants of Partition Matrices
journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised
More informationGroup, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,
Group, Rings, and Fields Rahul Pandharipande I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationWe are already familiar with the concept of a scalar and vector. are unit vectors in the x and y directions respectively with
Math Review We are already familiar with the concept of a scalar and vector. Example: Position (x, y) in two dimensions 1 2 2 2 s ( x y ) where s is the length of x ( xy, ) xi yj And i, j ii 1 j j 1 i
More informationBasic concepts of probability theory
Basic concepts of probability theory Random variable discrete/continuous random variable Transform Z transform, Laplace transform Distribution Geometric, mixed-geometric, Binomial, Poisson, exponential,
More informationYOU CAN BACK SUBSTITUTE TO ANY OF THE PREVIOUS EQUATIONS
The two methods we will use to solve systems are substitution and elimination. Substitution was covered in the last lesson and elimination is covered in this lesson. Method of Elimination: 1. multiply
More informationi.e. the i-th column of A is the value of T at the i-th standard basis vector e i R n.
Aim lecture In first year you learnt that you can mutliply not only a (real matrix with a (real vector, but more generally, matrices together (of compatible sizes. Furthermore, you learnt the following
More informationGraphics (INFOGR), , Block IV, lecture 8 Deb Panja. Today: Matrices. Welcome
Graphics (INFOGR), 2017-18, Block IV, lecture 8 Deb Panja Today: Matrices Welcome 1 Today Matrices: why and what? Matrix operations Determinants Adjoint/adjugate and inverse of matrices Geometric interpretation
More informationarxiv: v1 [math.pr] 4 Nov 2016
Perturbations of continuous-time Markov chains arxiv:1611.1254v1 [math.pr 4 Nov 216 Pei-Sen Li School of Mathematical Sciences, Beijing Normal University, Beijing 1875, China E-ma: peisenli@ma.bnu.edu.cn
More informationBasic concepts of probability theory
Basic concepts of probability theory Random variable discrete/continuous random variable Transform Z transform, Laplace transform Distribution Geometric, mixed-geometric, Binomial, Poisson, exponential,
More informationLinear Equations and Matrix
1/60 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Gaussian Elimination 2/60 Alpha Go Linear algebra begins with a system of linear
More informationLU Factorization. LU Decomposition. LU Decomposition. LU Decomposition: Motivation A = LU
LU Factorization To further improve the efficiency of solving linear systems Factorizations of matrix A : LU and QR LU Factorization Methods: Using basic Gaussian Elimination (GE) Factorization of Tridiagonal
More informationLyapunov stability ORDINARY DIFFERENTIAL EQUATIONS
Lyapunov stability ORDINARY DIFFERENTIAL EQUATIONS An ordinary differential equation is a mathematical model of a continuous state continuous time system: X = < n state space f: < n! < n vector field (assigns
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1
More informationBasic Concepts in Linear Algebra
Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University February 2, 2015 Grady B Wright Linear Algebra Basics February 2, 2015 1 / 39 Numerical Linear Algebra Linear
More informationPHYS 705: Classical Mechanics. Rigid Body Motion Introduction + Math Review
1 PHYS 705: Classical Mechanics Rigid Body Motion Introduction + Math Review 2 How to describe a rigid body? Rigid Body - a system of point particles fixed in space i r ij j subject to a holonomic constraint:
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 11 CRFs, Exponential Family CS/CNS/EE 155 Andreas Krause Announcements Homework 2 due today Project milestones due next Monday (Nov 9) About half the work should
More informationIndex Notation for Vector Calculus
Index Notation for Vector Calculus by Ilan Ben-Yaacov and Francesc Roig Copyright c 2006 Index notation, also commonly known as subscript notation or tensor notation, is an extremely useful tool for performing
More informationA Higher-Order Interactive Hidden Markov Model and Its Applications Wai-Ki Ching Department of Mathematics The University of Hong Kong
A Higher-Order Interactive Hidden Markov Model and Its Applications Wai-Ki Ching Department of Mathematics The University of Hong Kong Abstract: In this talk, a higher-order Interactive Hidden Markov Model
More informationDirect Limits. Mathematics 683, Fall 2013
Direct Limits Mathematics 683, Fall 2013 In this note we define direct limits and prove their basic properties. This notion is important in various places in algebra. In particular, in algebraic geometry
More informationDeterminants. Chia-Ping Chen. Linear Algebra. Professor Department of Computer Science and Engineering National Sun Yat-sen University 1/40
1/40 Determinants Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra About Determinant A scalar function on the set of square matrices
More informationInterpolated Rigid-Body Motions and Robotics
Interpolated Rigid-Body Motions and Robotics J.M. Selig London South Bank University and Yuanqing Wu Shanghai Jiaotong University. IROS Beijing 2006 p.1/22 Introduction Interpolation of rigid motions important
More informationDiameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring
International Mathematical Forum, Vol. 9, 2014, no. 29, 1369-1375 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.47131 Diameter of the Zero Divisor Graph of Semiring of Matrices over
More information