22
arXiv:math/0703375v1 [math.PR] 13 Mar 2007 P P n P N P n

arXiv:math/0703375v1 [math.PR] 13 Mar 2007

  • Upload
    others

  • View
    5

  • Download
    0

Embed Size (px)

Citation preview

Page 1: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

arX

iv:m

ath/

0703

375v

1 [

mat

h.PR

] 1

3 M

ar 2

007

Random walks and orthogonal polynomials: some

hallenges

F. Alberto Grünbaum

Abstra t. The study of several naturally arising �nearest neigh-

bours" random walks bene�ts from the study of the asso iated

orthogonal polynomials and their orthogonality measure. I on-

sider extensions of this approa h to a larger lass of random walks.

This raises a number of open problems.

To Henry, tea her and friend, with gratitude and admiration.

1. Introdu tion

Consider a birth and death pro ess, i.e., a dis rete time Markov

hain on the nonnegative integers, with a one step transition probability

matrix P. There is then a time-honored way of writing down the n-step

transition probability matrix Pnin terms of the orthogonal polynomials

asso iated to P and the spe tral measure. This goes ba k to [KM G℄

and, as they observe, this is nothing but an appli ation of the spe tral

theorem. One an �nd some pre ursors of these powerful ideas, see for

instan e [H, LR℄. In as mu h as this is su h a deep and general result,

it holds in many setups, su h as a nearest neighbours random walk on

the Nth-roots of unity. In general this representation of Pnallows one

to relate properties of the Markov hain, su h as re urren e or other

limiting behaviour, to properties of the orthogonality measure.

In the few ases when one an get one's hands on the orthogonal-

ity measure and the polynomials themselves this gives fairly expli it

answers to various questions.

2000 Mathemati s Subje t Classi� ation. 33C45, 22E45.

Key words and phrases. Matrix valued orthogonal polynomials, Karlin-

M Gregor representation, Ja obi polynomials.

The author was supported in part by NSF Grant # DMS 0603901.

1

Page 2: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

2 F. ALBERTO GRÜNBAUM

The two main drawba ks to the appli ability of this representation

(to be re alled below) are:

a) typi ally one annot get either the polynomials or the measure

expli itly.

b) the method is restri ted to �nearest neighbour" transition prob-

ability hains that give rise to tridiagonal matri es and thus

to orthogonal polynomials.

The hallenge that we pose in this paper is very simple: try to

extend the lass of Markov pro esses whose study an bene�t from a

similar asso iation.

There is an important olle tion of papers that study in detail the

ases where the entries in P depends linearly, quadrati ally or even ra-

tionally on the index n. We make no attempt to review these results,

but we just mention that the linear ase involves (asso iated) Laguerre

and Meixner polynomials, and the other ases involve asso iated dual

Hahn polynomials. For a very small sample of important sour es deal-

ing with this onne tion see [Ch, vD, ILMV℄.

The plan for this paper is as follows:

1) we �rst review brie�y the approa h of S. Karlin and J. M -

Gregor. This is done in se tion 2.

2) we onsider a few examples of physi ally important Markov

hains that happen to feature rather well known families of

orthogonal polynomials. This is done in se tions 3,4,5.

3) we propose a way of extending this representation to the ase

of ertain Markov hains where the one-step transition prob-

abilty matrix is not ne essarily tridiagonal. For on retness

we restri t ourselves to the ase of pentadiagonal matri es or

more generally blo k tridiagonal matri es. This is illustrated

with some examples. This material takes up se tions 6,7,8,9

and 10.

4) A number of open problems are mentioned along the way. A

few more are listed in se tion 11.

Both parts 1) and 2) above are well known while the proposal in 3)

appears to be new.

2. The Karlin-M Gregor representation

If we have

Pi,j = Pr{X(n+ 1) = j|X(n) = i}

Page 3: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 3

for the 1-step transition probability of our Markov hain, and we put

pi = Pi,i+1, qi+1 = Pi+1,i, and ri = Pi,i we get for the matrix P, in the

ase of a birth and death pro ess, the expression

P =

r0 p0 0 0q1 r1 p1 00 q2 r2 p2

.

.

.

.

.

.

.

.

.

We will assume that pj > 0, qj+1 > 0 and rj ≥ 0 for j ≥ 0. We also

assume pj+rj+qj = 1 for j ≥ 1 and by putting p0+r0 ≤ 1 we allow for

the state j = 0 to be an absorbing state (with probability 1− p0 − r0).Some of these onditions an be relaxed.

If one introdu es the polynomialsQj(x) by the onditions Q−1(0) =0, Q0(x) = 1 and using the notation

Q(x) =

Q0(x)Q1(x)

.

.

.

we insist on the re ursion relation

PQ(x) = xQ(x)

one proves the existen e of a unique measure ψ(dx) supported in [−1, 1]su h that

πj

∫ 1

−1

Qi(x)Qj(x)ψ(dx) = δij

and one gets the Karlin-M Gregor representation formula

(Pn)ij = πj

∫ 1

−1

xnQi(x)Qj(x)ψ(dx).

Many general results an be obtained from the representation formula

given above. Some of these will be given for ertain examples in the

next three se tions.

Here we just remark that the existen e of

limn→∞

(Pn)ij

is equivalent to ψ(dx) having no mass at x = −1. If this is the ase

this limit is positive exa tly when ψ(dx) has some mass at x = 1.If one noti es that Qn(x) is nothing but the determinant of the

(n+1)× (n+1) upper-left orner of the matrix xI −P, divided by the

fa tor

p0p1...pn−1,

Page 4: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

4 F. ALBERTO GRÜNBAUM

and one de�nes the polynomials qn(x) by solving the same three-term

re ursion relation satis�ed by the polynomials Qn(x), but with the

indi es shifted by one, and the initial onditions q0(x) = 1, q1(x) =(x− r1)/p1 then it is lear that the (0, 0) entry of the matrix

(xI − P)−1

should be given, ex ept by the onstant p0, by the limit of the ratio

qn−1(x)/Qn(x).

On the other hand the same spe tral theorem alluded to above

establishes an intimate relation between

limn→∞qn−1(x)/Qn(x)

and

∫ 1

−1

dψ(λ)

x− λ.

We will see in some of the examples a probabilisti interpretation

for the right hand side of the expression above in terms of generating

fun tions.

The same onne tion with orthogonal polynomials holds in the ase

of a birth and death pro ess with ontinuous time, and this has been

extensively des ribed in the literature. The dis rete time situation

dis ussed above is enough to illustrate the power of this method.

3. The Ehrenfest urn model

Consider the ase of a Markov hain in the �nite state spa e 0, 1, 2, ..., 2Nwhere the matrix P given by

0 112N

0 2N−12N

22N

0 2N−22N

.

.

. 0.

.

.

.

.

.

.

.

.

.

.

.

.

.

. 0 12N

2N2N

0

This situation arises in a model introdu ed by P. and T. Ehrenfest,

see [E℄, in an e�ort to illustrate the issue that irreversibility and re-

urren e an oexist. The ba kground here is, of ourse, the famous

H-theorem of L. Boltzmann.

Page 5: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 5

For a more detailed dis ussion of the model see [F, K℄. This model

has also been onsidered in dealing with a quantum me hani al version

of a dis rete harmoni os illator by S hroedinger himself, see [S hK℄.

In this ase the orresponding orthogonal polynomials (on a �nite

set) an be given expli itly. Consider the so alled Krawt houk poly-

nomials, given by means of the (trun ated) Gauss series

2F̃1

(

a, bc; z

)

=2N∑

0

(a)n(b)nn!(c)n

zn

with

(a)n ≡ a(a+ 1) . . . (a + n− 1), (a)0 = 1

The polynomials are given by

Ki(x) = 2F̃1

(

−i,−x−2N

; 2

)

x = 0, 1, . . . , 2N ; i = 0, 1, . . . , 2N

Observe that

K0(x) ≡ 1, Ki(2N) = (−1)i.

The orthogonality measure is read o� from

2N∑

x=0

Ki(x)Kj(x)

(

2Nx

)

22N=

(−1)ii!

(−2N)iδij ≡ π−1

i δij 0 ≤ i, j ≤ 2N.

These polynomials satisfy the se ond order di�eren e equation

1

2(2N − i)Ki+1(x)−

1

22NKi(x) +

i

2Ki−1(x) = −xKi(x)

and this has the onsequen e that

0 112N

0 2N−12N

22N

0 2N−22N

.

.

. 0.

.

.

.

.

.

.

.

.

.

.

.

.

.

. 0 12N

2N2N

0

K0(x)K1(x)

K2N(x)

=(

1− x

N

)

K0(x)K1(x)

.

.

.

K2N(x)

any time that x is one of the values x = 0, 1, . . . , 2N . This means that

the eigenvalues of the matrix P above are given by the values of 1− xN

at these values of x, i.e.,

1, 1− 1

N, . . . ,−1

Page 6: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

6 F. ALBERTO GRÜNBAUM

and that the orresponding eigenve tors are the values of [K0(x), K1(x), . . . , K2N(x)]T

at these values of x.Sin e the matrix P above is the one step transition probability ma-

trix for our urn model we on lude that

(Pn)ij = πj

2N∑

x=0

(

1− x

N

)n

Ki(x)Kj(x)

(

2Nx

)

22N.

We an use these expressions to rederive some results given in [K℄.

We have

(Pn)00 =

2N∑

x=0

(

1− x

N

)n

(

2Nx

)

22N

and the �generating fun tion� for these probabilities, de�ned by

U(z) ≡∞∑

n=0

zn(Pn)00

be omes

U(z) =2N∑

x=0

N

N(1− z) + xz

(

2Nx

)

22N.

In parti ular U(1) = ∞ and then the familiar �renewal equation�, see

[F℄ given by

U(z) = F (z)U(z) + 1

where F (z) is the generating fun tion for the probabilities fn of return-ing from state 0 to state 0 for the �rst time in n steps

F (z) =

∞∑

n=0

znfn

gives

F (z) = 1− 1

U(z)

Therefore we have F (1) = 1, indi ating that one returns to state 0 withprobability one in �nite time.

These results allow us to ompute the expe ted time to return to

state 0. This expe ted value is given by F ′(1), and we have

F ′(z) =U ′(z)

U2(z).

Page 7: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 7

Sin e

U ′(z) =

2N∑

x=0

N(N − x)

(N(1 − z) + xz)2

(

2Nx

)

22N

we get F ′(1) = 22N . The same method shows that any state i =0, . . . , 2N is also re urrent and that the expe ted time to return to it

is given by

22N(

2Ni

) .

The moral of this story is lear: if i = 0 or 2N , or if i is lose to these

values, i.e., we start from a state where most balls are in one urn it will

take on average a huge amount of time to get ba k to this state.

If on the other hand i = N , i.e., we are starting from a very balan ed

state, then we will (on average) return to this state fairly soon. Thus

we see how the issues of irreversibility and re urren e are rather subtle.

In a very pre ise sense these polynomials are dis rete analogs of

those of Hermite in the ase of the real line. For interesting material

regarding this se tion the reader should onsult [A℄.

4. A Chebyshev type example

The example below illustrates ni ely how ertain re urren e prop-

erties of the pro ess are related to the presen e of point masses in the

orthogonality measure. This is seen by omparing the two integrals at

the end of the se tion.

Consider the matrix

P =

0 1 0q 0 p0 q 0 p

.

.

.

.

.

.

.

.

.

with 0 ≤ p ≤ 1 and q = 1 − p. We look for polynomials Qj(x) su hthat

Q−1(x) = 0, Q0(x) = 1

Page 8: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

8 F. ALBERTO GRÜNBAUM

and if Q(x) denotes the ve tor

Q(x) ≡

Q0(x)Q1(x)Q2(x)

.

.

.

we ask that we should have

PQ(x) = xQ(x).

The matrix P an be onjugated into a symmetri one and in this

fashion one an �nd the expli it expression for these polynomials.

We have

Qj(x) =

(

q

p

)j/2 [

(2− 2p)Tj

(

x

2√pq

)

+ (2p− 1)Uj

(

x

2√pq

)]

where Tj and Uj are the Chebyshev polynomials of the �rst and se ond

kind.

If p ≥ 1/2 we have

(

p

1− p

)n ∫√4pq

−√4pq

Qn(x)Qm(x)

4pq − x2

1− x2dx = δnm

{

2(1− p)π, n = 0

2p(1− p)π, n ≥ 1

while if p ≤ 1/2 we get a new phenomenon, namely the presen e of

point masses in the spe tral measure

(

p

1− p

)n[

√4pq

−√4pq

Qn(x)Qm(x)

4pq − x2

1− x2dx

+ (2− 4p)π[Qn(1)Qm(1) +Qn(−1)Qm(−1)]

]

= δnm

{

2(1− p)π, n = 0

2p(1− p)π, n ≥ 1

From a probabilisti point of view these results are very natural.

5. The Hahn polynomials, Lapla e and Bernoulli

As has been pointed out before, a limitation of this method is given

by the sad fa t that given the matrix P very seldom an one write down

the orresponding polynomials and their orthogonality measure. In

general there is no reason why "physi ally interesting" Markov hains

Page 9: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 9

will give rise to situations where these mathemati al obje ts an be

found expli itly.

The example below shows that one an get lu ky: there is a very

old model of the ex hange of heat between two bodies going ba k to

Lapla e and Bernoulli, see [F℄, page 378. It turns out that in this ase

the orresponding orthogonal polynomials an be determined expli itly.

The Bernoulli�Lapla e model for the ex hange of heat between two

bodies onsists of two urns, labeled 1 and 2. Initially there areW white

balls in urn 1 and B bla k balls in urn 2. The transition me hanism

is as follows: a ball is pi ked from ea h urn and these two balls are

swit hed. It is natural to expe t that eventually both urns will have a

ni e mixture of white and bla k balls.

The state of the system at any time is des ribed by w, de�ned to

be the number of white balls in urn 1. It is lear that we have, for

w = 0, 1, . . . ,W

Pw,w+1 =W − w

W

W − w

B

Pw,w−1 =w

W

B −W + w

B

Pw,w =w

W

W − w

B+W − w

W

B −W + w

B.

Noti e that

Pw,w−1 + Pw,w + Pw,w+1 = 1.

Introdu e now the dual Hahn polynomials by means of

Rn(λ(x)) = 3F̃2

(

−n,−x, x−W −B − 1−W,−W

1

)

n = 0, . . . ,W ; x = 0, . . . ,W.

These polynomials depend in general on one more parameter.

Noti e that these are polynomials of degree n in

λ(x) ≡ x(x−W − B − 1).

One has

Pw,w−1Rw−1 + Pw,wRw + Pw,w+1Rw+1 =

(

1− x(B +W − x+ 1)

BW

)

Rw.

Page 10: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

10 F. ALBERTO GRÜNBAUM

This means that for ea h value of x = 0, . . . ,W the ve tor

R0(λ(x))R1(λ(x))

.

.

.

RW (λ(x))

is an eigenve tor of the matrix P with eigenvalue 1− x(B+W−x+1)BW

. The

relevant orthogonality relation is given by

πj

W∑

x=0

Ri(λ(x))Rj(λ(x))µ(x) = δij

with

µ(x) =w!(−w)x(−w)x(2x−W − B − 1)

(−1)x+1x!(−B)x(x−W − B − 1)w+1

πj =(−w)jj!

(−B)w−j

(w − j)!.

The Karlin�M Gregor representation gives

(Pn)ij = πj

W∑

x=0

Ri(λ(x))Rj(λ(x))en(x)µ(x)

with e(x) = 1− x(B+W−x+1)BW

.

These results an be used, on e again, to get some quantitative

results on this pro ess.

Interestingly enough, these polynomials were onsidered in great

detail by S. Karlin and J. M Gregor, [KM G2℄ and used by these au-

thors in the ontext of a model in geneti s des ribing �u tuations of

gene frequen y under the in�uen e of mutation and sele tion. The

reader will �nd useful remarks in [DS℄.

6. The lassi al orthogonal polynomials and the bispe tral problem

The examples dis ussed above illustrate the following point: quite

often the orthogonal polynomials that are asso iated with important

Markov hains belong to the small lass of polynomials usually referred

to as lassi al. By this one means that they satisfy not only three term

re ursion relations but that they are also the ommon eigenfun tions

of some �xed (usually se ond order) di�erential operator. The sear h

for polynomials of this kind goes ba k at least to [B℄. In fa t this issue

is even older, and was onsidered in a paper in 1884 by Routh. See

[I, R℄ for a more omplete dis ussion.

Page 11: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 11

In the ontext where both variables are ontinuous, this problem

has been raised in [DG℄. For a view of some related subje ts see [HK℄.

The reader will �nd useful material in [AW, AAR, I℄.

7. Matrix valued orthogonal polynomials

Here we re all a notion due to M. G. Krein, see [K1, K2℄. Given

a self adjoint positive de�nite matrix valued smooth weight fun tion

W (x) with �nite moments, we an onsider the skew symmetri bilinear

form de�ned for any pair of matrix valued polynomial fun tions P (x)and Q(x) by the numeri al matrix

(P,Q) = (P,Q)W =

R

P (x)W (x)Q∗(x)dx,

where Q∗(x) denotes the onjugate transpose of Q(x). By the usual

onstru tion this leads to the existen e of a sequen e of matrix valued

orthogonal polynomials with non singular leading oe� ient.

Given an orthogonal sequen e {Pn(x)}n≥0 one gets by the usual

argument a three term re ursion relation

(1) xPn(x) = AnPn−1(x) +BnPn(x) + CnPn+1(x),

where An, Bn and Cn are matri es and the last one is nonsingular.

We now turn our attention to an important lass of orthogonal

polynomials whi h we will all lassi al matrix valued orthogonal poly-

nomials. Very mu h as in [D, GPT2, GPT3℄ we say that the weight

fun tion is lassi al if there exists a se ond order ordinary di�erential

operator D with matrix valued polynomial oe� ients Aj(x) of degreeless or equal to j of the form

(2) D = A2(x)d2

dx2+ A1(x)

d

dx+ A0(x),

su h that for an orthogonal sequen e {Pn},we have(3) DP ∗

n = P ∗nΛn,

where Λn is a real valued matrix. This form of the eigenvalue equation

(3) appears naturally in [GPT1℄ and di�ers only super� ially with the

form used in [D℄, where one uses right handed di�erential operators.

During the last few years there has been quite a bit of a tivity en-

tered around an e�ort to produ e families of matrix valued orthogonal

polynomials that would satisfy di�erential equations as those above.

One of the examples that have resulted from this sear h, see [G℄, will

be parti ularly useful later on.

Page 12: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

12 F. ALBERTO GRÜNBAUM

8. Pentadiagonal matri es and matrix valued orthogonal polynomials

Given a pentadiagonal s alar matrix it is often useful to think of

it either in its original unblo ked form or as being made, let us say,

of 2 × 2 blo ks. These two ways of seeing a matrix, and the fa t that

matrix operations like multipli ation an by performed "by blo ks" has

proved very important in the development of fast algorithms.

In the ase of a birth and death pro ess it is useful to think of a

graph like

0 1 2 3

Suppose that we are dealing with a more ompli ated Markov hain

in the same probability spa e, where the elementary transitions an go

beyond "nearest neighbours". In su h a ase the graph may look as

follows

0 1 2 3

The matrix P going with the graph above is now pentadiagonal. By

thinking of it in the manner mentioned above we get a blo k tridiagonal

matrix. As an extra bonus, its o�-diagonal blo ks are triangular.

Page 13: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 13

The graph below

0

2 4 6

1

3 5 7

learly orresponds to a general blo k tridiagonal matrix, with blo ks

of size 2× 2.If Pi,j denotes the i, j blo k of P we an generate a sequen e of 2×2

matrix valued polynomials Qi(t) by imposing the three term re ursion

of se tion 8. By using the notation of se tion 2, we would have

PQ(x) = xQ(x)

where the entries of the olumn ve tor Q(x) are now 2× 2 matri es.

Pro eeding as in the s alar ase, this relation an be iterated to

give

PnQ(x) = xnQ(x)

and if we assume the existen e of a weight matrix W (x) as in se tion

7, with the property

(Qj , Qj)δi,j =

R

Qi(x)W (x)Q∗j (x)dx,

it is then lear that one an get an expression for the (i, j) entry of the

blo k matrix Pnthat would look exa tly as in the s alar ase, namely

(Pn)ij(Qj, Qj) =

xnQi(x)W (x)Q∗j (x)dx.

Just as in the s alar ase, this expression be omes useful when

we an get our hands on the matrix valued polynomials Qi(x) and

the orthogonality measure W (x). Noti e that we have not dis ussed

Page 14: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

14 F. ALBERTO GRÜNBAUM

onditions on the matrix P to give rise to su h a measure. For this issue

the reader an onsult [DP, D1℄ and the referen es in these papers.

The spe tral theory of a s alar double-in�nite tridiagonal matrix

leads naturally to a 2 × 2 semi-in�nite matrix. This has been looked

at in terms of random walks in [P℄. In [ILMV℄ this work is elaborated

further to get a formula that ould be massaged to look like the right

hand side of the one above.

9. An expli it example

Consider the matrix valued polynomials given by the 3-term re ur-

sion relation

AnΦn−1(x) +BnΦn(x) + CnΦn+1(x) = tΦn(x), n ≥ 0

Φ−1(x) = 0, Φ0(t) = I

where the entries in An, Bn, Cn are given below.

Page 15: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 15

Noti e that the matri es An and Cn are upper and lower triangular

respe tively.

A11n :=

n(α + n)(β + 2α + 2n+ 3)

(β + α + 2n+ 1)(β + α + 2n+ 2)(β + 2α+ 2n + 1)

A12n :=

2n(β + 1)

(β + 2n+ 1)(β + α+ 2n + 2)(β + 2α + 2n+ 1)

A21n := 0

A22n :=

n(α + n+ 1)(β + 2n + 3)

(β + 2n+ 1)(β + α+ 2n + 2)(β + α + 2n+ 3)

B11n := 1 +

n(β + n+ 1)(β + 2n− 1)

(β + 2n+ 1)(β + α+ 2n + 1)

− (n + 1)(β + n+ 2)(β + 2n+ 1)

(β + 2n+ 3)(β + α + 2n+ 3)

− 2(β + 1)2

(β + 2n+ 1)(β + 2n+ 3)(β + 2α + 2n+ 3)

B12n :=

2(β + 1)(α + β + n+ 2)

(β + 2n+ 3)(β + α+ 2n + 2)(β + 2α + 2n+ 3)

B21n :=

2(α + n+ 1)(β + 1)

(β + 2n+ 1)(β + α+ 2n + 3)(β + 2α + 2n+ 3)

B22n := 1 +

n(β + n+ 1)(β + 2n+ 3)

(β + 2n+ 1)(β + α+ 2n + 2)

− (n + 1)(β + n+ 2)(β + 2n+ 5)

(β + 2n+ 3)(β + α + 2n+ 4)

+2(β + 1)2

(β + 2n+ 1)(β + 2n+ 3)(β + 2α + 2n+ 3)

and �nally for the entries of Cn we have

C11n :=

(β + n+ 2)(β + 2n + 1)(β + α + n+ 2)

(β + 2n + 3)(β + α + 2n+ 2)(β + α + 2n+ 3)

C12n := 0

C21n :=

2(β + 1)(β + n+ 2)

(β + 2n + 3)(β + α + 2n+ 3)(β + 2α + 2n+ 5)

C22n :=

(β + n+ 2)(β + α + n + 3)(β + 2α + 2n+ 3)

(β + α + 2n+ 3)(β + α + 2n+ 4)(β + 2α + 2n+ 5).

Page 16: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

16 F. ALBERTO GRÜNBAUM

If the matrix Ψ0(x) is given by

Ψ0(x) =

(

1 1

1 (β+2α+3)xβ+1

− 2(α+1)β+1

)

one an see that the polynomials Φn(x) satisfy the orthogonality rela-

tion

∫ 1

0

Φi(x)W (x)Φ∗j (x)dx = 0 if i 6= j

where

W (x) = Ψ0(x)

(

(1− x)βxα+1 00 (1− x)βxα

)

Ψ∗0(x).

The polynomials Φn(x) are � lassi al� in the sense that they are eigen-

fun tions of a �xed se ond order di�erential operator. More pre isely,

we have

FΦ∗n = Φ∗

nΛn

where

Λn =

(

−n2 − (α + β + 2)n+ α + 1 + β+12

00 −n2 − (α + β + 3)n

)

and F is given by

F = x(1 − x)

(

d

dx

)2

+

(

(α+1)(β+2α+5)β+2α+3

− (α + β + 3)x 2α+22α+β+3

+ xβ+1

β+2α+3(α+2)β+2α2+5α+4

β+2α+3− (α + β + 4)x

)

d

dx

+

(

α + 1 + β+12

00 0

)

I.

As mentioned earlier this is the reason why this example has sur-

fa ed re ently, see [G℄. An expli it expression for the polynomials then-

selves is given in [T2℄, orollary 3.

Now we make two observations

1) the entries of the orresponding pentadigonal matrix are all

non-negative.

2) the sum of the entries on any given row are all equal to 1.

This allows for an immediate probabilisti interpretation of the pen-

tadiagonal matrix as the one step transition probability matrix for a

Page 17: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 17

Markov hain whose state spa e ould be visualized by the graph given

below.

0

2 4 6

1

3 5 7

I �nd it rather remarkable that this example whi h was produ ed for

an entirely di�erent purpose should have this extra property. Finding

an appropriate ombinatorial me hanism, maybe in terms of urns, that

goes along with this example remains an interesting hallenge.

Two �nal observations dealing with these state spa es that an be

analyzed using matrix valued orthogonal polynomials. If we were using

matrix valued polynomials of size N we would have as state spa e a

semiin�nite network onsisting of N (instead of two) parallel olle tion

of non-negative integers with onne tions going from ea h of the Nstates on ea h verti al rung to every one in the same rung and the

two neighbouring ones. The examples in [GPT1℄ give instan es of this

situation with a rather lo al onne tion pattern.

In the ase of N = 2 one ould be tempted to paraphrase a well

known paper and say that "it has not es aped our noti e that" some

of these models ould be used to study transport phenomena along a

DNA segment.

10. Another example

Here we onsider a di�erent example of matrix valued orthogonal

polynomials whose blo k tridiagonal matrix an be seen as a s alar

pentadiagonal matrix with non-negative elements. In this ase the

sum of the elements in the rows of this s alar matrix is not identi ally

one, but this poses no problem in terms of a Karlin�M Gregor type

representation formula for the entries of the powers Pn.

Page 18: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

18 F. ALBERTO GRÜNBAUM

This example has the important property that the orthogonality

weight matrix W (x), as well as the polynomials themselves are expli -

itly known. This is again, a lassi al situation, see [CG℄.

Consider the blo k tridiagonal matrix

B0 IA1 B1 I0 A2 B2 I

.

.

.

.

.

.

.

.

.

with 2× 2 blo ks given as follows

B0 =1

2I, Bn = 0 if n ≥ 1

An =1

4I if n ≥ 1.

In this ase one an ompute expli itly the matrix valued polynomials

Pn given by

AnPn−1(x) +BnPn(x) + Pn+1(x) = xPn(x), P−1(x) = 0, P0(x) = I.

One gets

Pn(x) =1

2n

(

Un(x) −Un−1(x)−Un−1(x) Un(x)

)

where Un(x) are the Chebyshev polynomials of the se ond kind.

The orthogonality measure is read o� from the identity

4i

π

∫ 1

−1

Pi(x)1√

1− x2

(

1 xx 1

)

Pj(x)dx = δijI.

We get, for n = 0, 1, 2, . . .

4i

π

∫ 1

−1

xnPi(x)1√

1− x2

(

1 xx 1

)

Pj(x)dx = (Pn)ij

where, as above,

(Pn)ij

stands for the i, j blo k of the matrix Pn.

In this way one an ompute the entries of the powers Pnwith P

n

thought of as a pentadiagonal matrix, namely

Page 19: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 19

P =

0 12

1 0 0 012

0 0 1 0 0.

.

.

14

0 0 0 1 0.

.

.

0 14

0 0 0 1.

.

.

0 14

0 0 0.

.

.

0 14

0 0.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

This example goes along with the following graph.

0 2 4 6

1 3 5 7

11. A few more hallenges

We have already pointed out a few hallenges raised by our at-

tempt to extend the Karlin-M Gregor representation beyond its orig-

inal setup. Here we list a few more open problems. The reader will

undoubtedly ome up with many more.

Is there a natural version of the models introdu ed by Bernoulli-

Lapla e and by P. and T. Ehrenfest whose solution features matrix

valued polynomials?

Page 20: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

20 F. ALBERTO GRÜNBAUM

Is it possible to modify the simplest Chebyshev type examples in

[D1℄ to a omodate ases where some of the blo ks in the tridiagonal

matrix give either absorption or re�e tion boundary onditions?

One ould onsider the emerging lass of polynomials of several

variables and �nd here interesting instan es where the state spa e is

higher dimensional. For a systemati study of polynomials in several

variables one should onsult [DX℄ as well as the work on Ma donald

polynomials of various kinds, see [M℄. A look at the pioneering work

of Tom Koornwinder, see for instan e [Ko℄, is always a very good idea.

After this paper was �nished I ame up with two independent

sour es of multivariable polynomials of the type alluded to in the pre-

vious paragraph. One is the series of papers by Hoare and Rahman,

see [HR1, HR2, HR3, HR4℄. The other one deals with the papers [Mi℄

and [IX, GI℄.

In queueing theory one �nds the notion of Quasi-Birth-and-Death

pro esses, see [LR1, N℄. Within those that are nonhomogeneous one

ould �nd examples where the general approa h advo ated here might

be useful.

Referen es

[A℄ Askey, R. Evaluation of Sylvester type determinants using orthogonal

polynomials, Advan es in Analysis, Pro eed. 4th international ISAAC

Congress, ed. H.G.W. Begehr et al, World S ienti� , Singapore, (2005),

1�16.

[AAR℄ Andrews, G., Askey, R., and Roy, R., Spe ial fun tions, En y lopedia of

Mathemati s and its appli ations, Cambridge University Press, 1999.

[AW℄ Askey, R., and Wilson, J., Some basi hypergeometri orthogonal poly-

nomials that generalize Ja obi polynomials, Mem. Amer. Math. So ., 54

(1985) 319.

[B℄ Bo hner, S., Über Sturm�Liouvilles he polynomsysteme, Math Z. 29

(1929), 730�736.

[CG℄ Castro, M. and Grünbaum F. A., The algebra of matrix valued di�eren-

tial operators asso iated to a given family of matrix valued orthogonal

polynomials: �ve instru tive examples, International Math. Resear h No-

ti es, 2006:7 (2006), 1-33.

[Ch℄ Chihara, T., An introdu tion to orthogonal polynomials, Gordon and

Brea h S ien e Publishers, 1978.

[vD℄ van Doorn, E., On asso iated polynomials and de ay rates for birth-death

pro esses, J. Math. Anal. Appl. 278, (2003), 2, 500�511.

[DG℄ Duistermaat, J. J., and Grünbaum, F. A., Di�erential equations in the

spe tral parameter, Comm. Math. Phys. 103 (1986), 177�240.

Page 21: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

RANDOM WALKS AND ORTHOGONAL POLYNOMIALS 21

[D℄ Duran, A., Matrix inner produ t having a matrix symmetri se ond order

di�erential operators, Ro ky Mountain Journal of Mathemati s 27, No. 2,

Spring 1997.

[D1℄ Duran, A. J., Ratio Asymptoti s for orthogonal matrix polynomials, J.

Approximation Theory 100 (1999), 304�344.

[DP℄ Duran, A. J. and Polo, B., Gauss quadrature formulae for orthogonal

matrix polynomials, Linear Alg. Appl. 355 (2002), 119�146.

[DS℄ Dia onis, P. and Shahshahani, M., Time to rea h stationarity in the

Bernoulli-Lapla e di�usion model, SIAM J. Math. Anal. 18, 208�218,

1987.

[DX℄ Dunkl, C. and Xu, Y., Orthogonal polynomials of several variables, Cam-

bridge University Press, 2001.

[E℄ Ehrenfest, P. and Eherenfest, T. , Über zwei bekannte Einwände gegen

das Boltzmanns he H-Theorem, Physikalis he Zeits hrift, vol 8, 1907,

311�314.

[F℄ Feller, W., An introdu tion to Probability Theory and its Appli ations,

vol 1, 3rd edition, Wiley 1967.

[GI℄ Geronimo, J. and Iliev, P., Two variable deformations of the Chebyshev

measure arXiv.math.CA/0612489v1

[G℄ Grünbaum, F. A., Matrix valued Ja obi polynomials, Bull. S i. Math

127, (2003) 207�214.

[GPT1℄ Grünbaum, F. A., Pa haroni, I., and Tirao, J. A., Matrix valued spher-

i al fun tions asso iated to the omplex proje tive plane, J. Fun tional

Analysis 188 (2002) 350�441.

[GPT2℄ Grünbaum, F. A., Pa haroni, I., and Tirao, J. A., Matrix valued or-

thogonal polynomials of the Ja obi type, Indag. Mathem. 14 3,4 (2003),

353�366.

[GPT3℄ Grünbaum F. A., Pa haroni I. and Tirao J. A., Matrix valued orthogonal

polynomials of the Ja obi type: The role of group representation theory,

Ann. Inst. Fourier, Grenoble, 55 , 6, (2005), 2051�2068.

[H℄ Harris, T. E., First passages and re urren e distributions, Trans. Amer-

i an Math. So . 73, (1952) 471�486.

[HK℄ Harnard, J., and Kasman, A. (editors) The bispe tral problem, CRM

Pro eedings and le ture notes. Univ. de Montreal, vol 14, 1998.

[HR1℄ M. Hoare and M. Rahman, Distributive pro esses in dis rete systems,

Physi a, 97 A, (1979), 1�41.

[HR2℄ M. Hoare and M. Rahman, Cumultive Bernoulli trials and Krawt houk

pro esses, Sto hasti Pro esses and their appli ations, 16 , (1983), 113�

139

[HR3℄ M. Hoare and M. Rahman, Cumultive hypergeometri pro esses: a statis-

ti al role for the nFn−1 fun tions, J. Math. Anal. Appl. , 135 (2), (1988)

, 615�626.

[HR4℄ M. Hoare and M. Rahman, A probabilisti origin for a new lass of bi-

variate polynomials, to appear in JCAM, 2007.

[IX℄ Iliev, P. and Xu, Y. , Dis rete orthogonal polynomials and di�eren e

equations of several variables, arXiv.math.CA/0508039v2

[I℄ Ismail,M.E.H., Classi al and Quantum Orthogonal Polynomials in One

Variable, Cambridge University Press, 2005.

Page 22: arXiv:math/0703375v1 [math.PR] 13 Mar 2007

22 F. ALBERTO GRÜNBAUM

[ILMV℄ Ismail, M.E.H., Letessier, J., Masson, D., and Valent, G., Birth and death

pro esses and orthogonal polynomials, Orthogonal Polynomials, P. Nevai

(editor) Kluwer A ad. Publishers, 1990.

[K℄ Ka , M., Random walk and the theory of Brownian motion, Ameri an

Math. Monthly (1947) 54, 369�391.

[KM G℄ Karlin, S., and M Gregor, J., The lassi� ation of birth and death pro-

esses, TAMS 86, 366�400, 1957.

[KM G2℄ Karlin, S., and M Gregor, J., The Hahn polynomials, formulas and ap-

pli ations, S ripta Math. 26, 33-46.

[Ko℄ Koornwinder, T. , Two variable analogues of the lassi al orthogonal

polynomials, in Theory and Appli . of Spe ial Fun tions, R. Askey (ed.)

A ademi Press, 1975, 435�495.

[K1℄ Krein, M. G., Fundamental aspe ts of the representation theory of her-

mitian operators with de� ien y index (m,m), AMS Translations, Series

2, vol. 97, Providen e, Rhode Island (1971), 75�143.

[K2℄ Krein, M. G., In�nite J-matri es and a matrix moment problem, Dokl.

Akad. Nauk SSSR 69 nr. 2 (1949) , 125�128.

[LR1℄ Latou he, G., and Ramaswami, V., Introdu tion to Matrix Analyti

Methods in Sto hasti Modeling, ASA-SIAM Series on Statisti s and

Applied Probability, 1999.

[LR℄ Ledermann, W., and Rueter, G. E., Spe tral theory for the di�erential

equations of simple birth and death pro esses, Philos. Trans. Roy. So .

London, Ser. A. 246, 1954, 321�369.

[M℄ Ma donald, I. , A�ne He ke algebras and orthogonal polynomials, Cam-

bridge Tra ts in Mathemati s, vol. 157, Cambridge University Press,

2003.

[Mi℄ Mil h, P. , A multidimensional linear growth birth and death pro esses,

The Annals of Math. Statisti s, 1968 , vol. 39, 3, pp 727�754.

[N℄ Neuts, M. F. , Stru tured Sto hasti Matri es of M/G/1 Type and TheirAppli ations, Mar el Dekker, NY, 1989.

[P℄ Pruitt, W. E. Bilateral birth and death pro esses, TAMS 107, 1963, 508�

525.

[R℄ Routh, E., On some properties of ertain solutions of a di�erential equa-

tion of the se ond order, Pro . London Math. So ., 16 (1884), 245�261.

[S hK℄ S hroedinger, E. and Kohlraus h , Das Ehrenfest he Model der H-Kurve,

Phys. Zeit. , 8, (1907) 311�314.

[T2℄ Tirao, J., The matrix valued hypergeometri equation, Pro . Nat. A ad.

S i. U.S.A., 100 nr. 14 (2003), 8138�8141.

Department of Mathemati s, University of California, Berkeley, CA 94720