The deviation matrix, Poissons equation, and QBDs Guy Latouche - - PowerPoint PPT Presentation

the deviation matrix poisson s equation and qbds
SMART_READER_LITE
LIVE PREVIEW

The deviation matrix, Poissons equation, and QBDs Guy Latouche - - PowerPoint PPT Presentation

Finite state space Infinite state space QBDs a primer Deviation matrix for QBDs Current work The deviation matrix, Poissons equation, and QBDs Guy Latouche Universit e libre de Bruxelles Symposium in honour of Erik van Doorn


slide-1
SLIDE 1

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

The deviation matrix, Poisson’s equation, and QBDs

Guy Latouche

Universit´ e libre de Bruxelles

Symposium in honour of Erik van Doorn Universiteit Twente — 26th of September, 2014

Joint work with Sarah Dendievel and Yuanyuan Liu, extensions with S. D., Dario Bini and Beatrice Meini

Deviation matrix for QBDs — Guy Latouche 26/09/2014 1 / 26

slide-2
SLIDE 2

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Poisson’s equation

One formulation: (I − P)x = d − z1 where P is the transition kernel of a Markov process, d is a given function of the state space, and x and z are the unknowns. P is a stochastic matrix, P ≥ 0, P1 = 1. finite or denumerable state space, irreducible, non-periodic, positive recurrent. Found in many places: Markov reward processes, Central limit thm for M.C., perturbation analysis, . . . Focus varies: need a specific solution x, z, or all solutions of the equation

Deviation matrix for QBDs — Guy Latouche 26/09/2014 2 / 26

slide-3
SLIDE 3

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Outline

1

Finite state space

2

Infinite state space

3

QBDs — a primer

4

Deviation matrix for QBDs

5

Current work

Deviation matrix for QBDs — Guy Latouche 26/09/2014 3 / 26

slide-4
SLIDE 4

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Finite State space

Deviation matrix for QBDs — Guy Latouche 26/09/2014 4 / 26

slide-5
SLIDE 5

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

For finite M.C., z is no worries

(I − P)x = d − z1 Markov chain is finite and irreducible, thus there exists a unique π such that πt(I − P) = 0, πt1 = 1. Premultiply by πt and get z = πtd So, might as well have written (I − P)x = d with πtd = 0. Of course, I − P is singular.

Deviation matrix for QBDs — Guy Latouche 26/09/2014 5 / 26

slide-6
SLIDE 6

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Generalized inverses

  • Generalized inverse of A:

AA+A = A A+AA+ = A+

  • Group inverse A#: in addition, AA# = A#A

— unique when it exists

  • Irreducible finite MC: (I − P)# exists and is unique solution to

(I − P)(I − P)# = I − 1πt, πt(I − P)# = 0

  • Fundamental matrix: Z = (I − P + 1πt)−1 = (I − P)#+1πt.
  • (I − P)#: preserves the structure of I − P
  • For algebraic/geometric properties of A#: Campbell and Meyer, Generalized

Inverses of Linear Transformations, 1979 — SIAM 2008

Deviation matrix for QBDs — Guy Latouche 26/09/2014 6 / 26

slide-7
SLIDE 7

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Finite state space is straightforward

(I − P)x = d with πtd = 0 If P is of finite order, then x is unique, up to an additive constant x = (I − P)#d + c1 (I − P)# is the group inverse of (I − P) c is an arbitrary constant actually, c = πtx

Deviation matrix for QBDs — Guy Latouche 26/09/2014 7 / 26

slide-8
SLIDE 8

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Deviation matrix

Define Nj(n) as the number of visits to j in [0 to n − 1]. (I − P)#

ij = lim n→∞(Ei[NJ(n)] − Eπ[Nj(n)])

= lim

n→∞(Ei[NJ(n)] − nπj)

Deviation matrix D D =

  • s≥0

(Ps − 1πt) Thus, (I − P)# = D (I − P)D = I − 1πt, πtD = 0 Important as one may rely upon physical interpretation In addition to geometric and algebraic properties

Deviation matrix for QBDs — Guy Latouche 26/09/2014 8 / 26

slide-9
SLIDE 9

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Continuous-time M.C. — infinite state space

  • Continuous-time M.C. with generator Q

−Q# = D = ∞ (eQs − 1πt) ds

  • Infinite state space: (I − P)# or Q# not well defined, but D is OK since its

physical meaning is preserved.

  • Pauline Coolen-Schrijner and Erik van Doorn, The deviation matrix of a

continuous-time Markov chain, 2002.

Deviation matrix for QBDs — Guy Latouche 26/09/2014 9 / 26

slide-10
SLIDE 10

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Continuous-time M.C. — infinite state space

  • Continuous-time M.C. with generator Q

−Q# = D = ∞ (eQs − 1πt) ds

  • Infinite state space: (I − P)# or Q# not well defined, but D is OK since its

physical meaning is preserved.

  • Pauline Coolen-Schrijner and Erik van Doorn, The deviation matrix of a

continuous-time Markov chain, 2002.

Deviation matrix for QBDs — Guy Latouche 26/09/2014 9 / 26

slide-11
SLIDE 11

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Infinite State space

Deviation matrix for QBDs — Guy Latouche 26/09/2014 10 / 26

slide-12
SLIDE 12

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Infinite state space

(I − P)x = d − z1 If state space is denumerably infinite, situation is more involved. Example (Makowski and Shwartz, 2002) P =        q p q p q p q ...        with p + q = 1. Take any d. For any z real, there exists a solution x. If one looks for a specific x and computes a solution, how does one know it’s the right one?

Deviation matrix for QBDs — Guy Latouche 26/09/2014 11 / 26

slide-13
SLIDE 13

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Constructive solution

Assume πt|d| < ∞ Take j to be an arbitrary state, T its first return time One solution is given by z = πtd xi = E[

  • 0≤n<T

dΦn|Φ0 = i] − zE[T|Φ0 = i]. Think of di as a reward per unit of time spent in state i. z is the asymptotic expected reward per unit of time. xi is the expected difference if start from i, up to a constant. xj = 0. Very much like D but sum to T instead of ∞ From now on: πtd.

Deviation matrix for QBDs — Guy Latouche 26/09/2014 12 / 26

slide-14
SLIDE 14

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Constructive solution — Censoring

Subset of states A, T first return time to A, P = PAA PAB PBA PBB

  • NB =
  • n≥0

Pn

BB

γi = E[

  • 0≤n<T

dΦn|Φ0 = i] One solution is given by xA = γA + (PAA + PABNBPBA)xA xB = γB + NBPBAxA This is Censoring, or Schur complementation.

Deviation matrix for QBDs — Guy Latouche 26/09/2014 13 / 26

slide-15
SLIDE 15

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

QBDs — a primer

Deviation matrix for QBDs — Guy Latouche 26/09/2014 14 / 26

slide-16
SLIDE 16

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

QBDs

Markov chains on two-dimensional state space (n, ϕ) : n = 0, 1, 2, . . . ; ϕ = 1, 2, . . . , M Often, n is length of a queue, named the level. changes by one unit at most ϕ may be many different things, named the phase. here M < ∞

Deviation matrix for QBDs — Guy Latouche 26/09/2014 15 / 26

slide-17
SLIDE 17

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Transition matrix

Block-structured transition matrix: P =           A∗ A1 · · · A−1 A0 A1 A−1 A0 A1 ... A−1 A0 ... . . . ... ... ...           Transition probabilities: (A1)ij probability to go up from (n, i) to (n + 1, j)

Deviation matrix for QBDs — Guy Latouche 26/09/2014 16 / 26

slide-18
SLIDE 18

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Transition matrix

Block-structured transition matrix: P =           A∗ A1 · · · A−1 A0 A1 A−1 A0 A1 ... A−1 A0 ... . . . ... ... ...           Transition probabilities: (A−1)ij probability to go down from (n, i) to (n − 1, j)

Deviation matrix for QBDs — Guy Latouche 26/09/2014 16 / 26

slide-19
SLIDE 19

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Transition matrix

Block-structured transition matrix: P =           A∗ A1 · · · A−1 A0 A1 A−1 A0 A1 ... A−1 A0 ... . . . ... ... ...           Transition probabilities: (A0)ij probability to stay in level n, (n, i) to (n, j), n = 0

Deviation matrix for QBDs — Guy Latouche 26/09/2014 16 / 26

slide-20
SLIDE 20

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Transition matrix

Block-structured transition matrix: P =           A∗ A1 · · · A−1 A0 A1 A−1 A0 A1 ... A−1 A0 ... . . . ... ... ...           Transition probabilities: (A∗)ij probability to remain in level 0, (0, i) to (0, j)

Deviation matrix for QBDs — Guy Latouche 26/09/2014 16 / 26

slide-21
SLIDE 21

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

matrices for QBDs

Analysis makes extensive use of matrices Gij = P[T < ∞, ΦT = (0, j)|Φ0 = (1, i)], Rij = E[

  • 0≤t<T

1[Φt = (1, j)]|Φ0 = (0, i)], U = A0 + A1G T first return time to level 0

Deviation matrix for QBDs — Guy Latouche 26/09/2014 17 / 26

slide-22
SLIDE 22

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Deviation matrix for QBDs

Deviation matrix for QBDs — Guy Latouche 26/09/2014 18 / 26

slide-23
SLIDE 23

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Constructive solution for QBDs

(I − P)X = D with D = I − 1πt XA = ΓA + (PAA + PABNBPBA)XA XB = ΓB + NBPBAXA A is level 0, B is collection of all levels ≥ 1. PAA + PABNBPBA = A∗ + A1G = P∗ NBPBA =    G G 2 . . .    X0 = Γ0 + P∗X0 Xn = Γn + G nX0 all n ≥ 1 Γn = accumulation during first passage time to level 0

Deviation matrix for QBDs — Guy Latouche 26/09/2014 19 / 26

slide-24
SLIDE 24

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Accumulation until level 0

(I − P)X = D with D = I − 1πt    Γ1 Γ2 . . .    =    D1 D2 . . .    +    A0 A1 A−1 A0 ...       Γ1 Γ2 . . .    =

  • n≥0

   A0 A1 A−1 A0 ...   

n 

  D1 D2 . . .    Need N =

  • n≥0

[•]n

Deviation matrix for QBDs — Guy Latouche 26/09/2014 20 / 26

slide-25
SLIDE 25

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Expected sojourn times

N(n,i)(k,j) is expected number of visits to (k, j) before level zero, starting from (n, i). For n > k n → n − 1 → · · · → k G G G (a) go down n − k levels from n to k and (b) start counting Nnk = G n−kNkk

Deviation matrix for QBDs — Guy Latouche 26/09/2014 21 / 26

slide-26
SLIDE 26

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Expected sojourn times

N(n,i)(k,j) is expected number of visits to (k, j) before level zero, starting from (n, i). For n < k (k) (k) (k) n → n → n · · · n → n ✁ (a) count visits to level n, (b) for each of these, count visits to level k − n steps higher. Nnk = NnnRk−n

Deviation matrix for QBDs — Guy Latouche 26/09/2014 21 / 26

slide-27
SLIDE 27

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Expected sojourn times

N(n,i)(k,j) is expected number of visits to (k, j) before level zero, starting from (n, i). For n = k (n) (n) (n) (n) n → n − 1 → n − 2 · · · → 1 → ✁ G G G G (a) Starting from level n, trajectory n ❀n − 1 ❀ . . . ❀1❀0 (b) A bit of calculation Nnn =

  • 0≤ν≤n−1

G ν(I − U)−1Rν

Deviation matrix for QBDs — Guy Latouche 26/09/2014 21 / 26

slide-28
SLIDE 28

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Summary

Interesting pattern N =        N11 N11R N11R2 N11R3 . . . GN11 N22 N22R N22R2 G 2N11 GN22 N33 N33R G 3N11 G 2N22 GN33 N44 . . . ...        N11 = (I − U)−1 Nkk = (I − U)−1 + G Nk−1,k−1R k ≥ 2

Deviation matrix for QBDs — Guy Latouche 26/09/2014 22 / 26

slide-29
SLIDE 29

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Deviation matrix

D =      D0 D1 D2 . . .      Dn =

  • Dn0

Dn1 Dn2 · · ·

  • D0 = (I − P∗)#{
  • I

0 . . .

  • − 1πt +
  • A1

. . .

  • Γ1} + 1v t

   D1 D2 . . .    = N    I · · · I . . . ...    − N 1πt +    G G 2 . . .    D0

Deviation matrix for QBDs — Guy Latouche 26/09/2014 23 / 26

slide-30
SLIDE 30

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Look for all the solutions

Current work with Dario B., Sarah D, and Beatrice M.

Deviation matrix for QBDs — Guy Latouche 26/09/2014 24 / 26

slide-31
SLIDE 31

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Matrix difference equations

(I − P)x = d For QBDs: (I − A∗)x0 − A1x1 = d0 (1) −A−1xn−1 + (I − A0)xn − A1xn+1 = dn n ≥ 1 (2) Standard thm: general solution of eqn (2) using spectral decomposition of matrix G Drazin inverse of matrix similar to R Eqn (1) gives boundary conditions Project: reconcile our solution with this formulation write general solution in terms of R and G directly

Deviation matrix for QBDs — Guy Latouche 26/09/2014 25 / 26

slide-32
SLIDE 32

Finite state space Infinite state space QBDs — a primer Deviation matrix for QBDs Current work

Best wishes, Erik, and I hope you have fun over the next umpteen years !

Deviation matrix for QBDs — Guy Latouche 26/09/2014 26 / 26