Urn models with multiple drawings Markus Kuba joint work with - - PowerPoint PPT Presentation

urn models with multiple drawings
SMART_READER_LITE
LIVE PREVIEW

Urn models with multiple drawings Markus Kuba joint work with - - PowerPoint PPT Presentation

Urn models with multiple drawings Markus Kuba joint work with May-Ru Chen; Hosam Mahmoud and Alois Panholzer AofA 2013 Cala Galdana, Menorca, Spain 30.05.2013 Content 1 Urn models - Introduction Urn models with multiple drawings 2 3


slide-1
SLIDE 1

Urn models with multiple drawings

Markus Kuba joint work with May-Ru Chen; Hosam Mahmoud and Alois Panholzer AofA 2013 Cala Galdana, Menorca, Spain 30.05.2013

slide-2
SLIDE 2

Content

1

Urn models - Introduction

2

Urn models with multiple drawings

3

Analysis using Analytic Combinatorics

AofA 2013, Menorca 2/26

slide-3
SLIDE 3

Urn models

  • Introduction
slide-4
SLIDE 4

Urn models

  • Introduction
slide-5
SLIDE 5

  • lya-Eggenberger urns

Urn contains n white and m black balls. Every discrete time steps a ball is drawn at random: pwhite =

n n+m, pblack = m n+m.

Color inspection: White - a white and b black balls are added/removed; Black - c white and d black balls are added/removed; a, b, c, d ∈ Z.

2 × 2 ball replacement matrix

M = a b c d

  • AofA 2013, Menorca

4/26

slide-6
SLIDE 6

  • lya-Eggenberger urns

Urn contains n white and m black balls. Every discrete time steps a ball is drawn at random: pwhite =

n n+m, pblack = m n+m.

Color inspection: White - a white and b black balls are added/removed; Black - c white and d black balls are added/removed; a, b, c, d ∈ Z.

2 × 2 ball replacement matrix

M = a b c d

  • AofA 2013, Menorca

4/26

slide-7
SLIDE 7

  • lya-Eggenberger urns

Urn contains n white and m black balls. Every discrete time steps a ball is drawn at random: pwhite =

n n+m, pblack = m n+m.

Color inspection: White - a white and b black balls are added/removed; Black - c white and d black balls are added/removed; a, b, c, d ∈ Z.

2 × 2 ball replacement matrix

M = a b c d

  • AofA 2013, Menorca

4/26

slide-8
SLIDE 8

  • lya-Eggenberger urns

Urn contains n white and m black balls. Every discrete time steps a ball is drawn at random: pwhite =

n n+m, pblack = m n+m.

Color inspection: White - a white and b black balls are added/removed; Black - c white and d black balls are added/removed; a, b, c, d ∈ Z.

2 × 2 ball replacement matrix

M = a b c d

  • AofA 2013, Menorca

4/26

slide-9
SLIDE 9

  • lya-Eggenberger urns

1

Tenable urns The process of drawing and adding/removing balls can be continued ad infinitum. We start with W0 ∈ N0 white and B0 ∈ N0 black balls: configuration Wn, Bn after n draws?

2

Diminishing urns The process of drawing and adding/removing balls stops after a finite number of steps. We start with n ∈ N0 white and m ∈ N0 black balls, define so-called absorbing states A: what is the probability of reaching a state a ∈ A?

3

Generalizations More than two colors.

AofA 2013, Menorca 5/26

slide-10
SLIDE 10

  • lya-Eggenberger urns

  • lya urn (tenable urns)

M = 1 0

0 1

  • Urn contains n white and m black balls:

(m,n) (m+1,n) (m,n+1)

m m+n n m+n

AofA 2013, Menorca 6/26

slide-11
SLIDE 11

  • lya-Eggenberger urns

  • lya urn (tenable urns)

M = 1 0

0 1

  • Urn contains n white and m black balls:

(m,n) (m+1,n) (m,n+1)

m m+n n m+n

AofA 2013, Menorca 6/26

slide-12
SLIDE 12

  • lya-Eggenberger urns

  • lya urn (tenable urns)

M = 1 0

0 1

  • Urn contains n white and m black balls:

(m,n) (m+1,n) (m,n+1)

m m+n n m+n

AofA 2013, Menorca 6/26

slide-13
SLIDE 13

  • lya-Eggenberger urns

2000-today: several approaches - very interesting developments Analytic Combinatorics (Symbolic methods, generating functions, etc.)

FLAJOLET, GABARR ´

O AND PEKARI; BRENNAN AND PRODINGER; STADJE;

DUMAS, FLAJOLET AND PUYHAUBERT; HWANG, K. AND PANHOLZER; FLAJOLET

AND MORCRETTE; MAHMOUD AND MORCRETTE; MORCRETTE; . . .

Probabilistic methods (stochastic processes, martingales)

KINGMAN2; KINGMAN AND VOLKOV; MAHMOUDx; PITTEL; JANSON2; CHAUVIN, POUYANNE ET AL.3; CHEN AND WEI; RENLUND; . . .

Contraction method (for balanced urns)

NEININGER AND KNAPE; CHAUVIN, POUYANNE AND MAILLER; . . .

. . .

An urn model M = a b

c d

  • is called balanced: a + b = c + d = σ.

Consequently: Tn = Wn + Bn = T0 + n · σ.

AofA 2013, Menorca 7/26

slide-14
SLIDE 14

  • lya-Eggenberger urns

2000-today: several approaches - very interesting developments Analytic Combinatorics (Symbolic methods, generating functions, etc.)

FLAJOLET, GABARR ´

O AND PEKARI; BRENNAN AND PRODINGER; STADJE;

DUMAS, FLAJOLET AND PUYHAUBERT; HWANG, K. AND PANHOLZER; FLAJOLET

AND MORCRETTE; MAHMOUD AND MORCRETTE; MORCRETTE; . . .

Probabilistic methods (stochastic processes, martingales)

KINGMAN2; KINGMAN AND VOLKOV; MAHMOUDx; PITTEL; JANSON2; CHAUVIN, POUYANNE ET AL.3; CHEN AND WEI; RENLUND; . . .

Contraction method (for balanced urns)

NEININGER AND KNAPE; CHAUVIN, POUYANNE AND MAILLER; . . .

. . .

An urn model M = a b

c d

  • is called balanced: a + b = c + d = σ.

Consequently: Tn = Wn + Bn = T0 + n · σ.

AofA 2013, Menorca 7/26

slide-15
SLIDE 15

  • lya-Eggenberger urns

2000-today: several approaches - very interesting developments Analytic Combinatorics (Symbolic methods, generating functions, etc.)

; ; ; ; ; ; ; . . .

Probabilistic methods (stochastic processes, martingales)

; ; ; ; ; ; ; ; . . .

Contraction method (for balanced urns)

; ;. . .

. . .

An urn model M = a b

c d

  • is called balanced: a + b = c + d = σ.

Consequently: Tn = Wn + Bn = T0 + n · σ.

AofA 2013, Menorca 7/26

slide-16
SLIDE 16

Urn models

  • Multiple drawings
slide-17
SLIDE 17

Urn models

  • Multiple drawings
slide-18
SLIDE 18

Urn models with multiple drawings

Previously: Urn contains w white and b black balls. Draw at random a single ball: pwhite =

w w+b, pblack = b w+b.

New model: We draw m 1 balls without replacement,

p{k times white, (m−k) times black } =

1

(b + w)m m k

  • wkbm−k,

with xs = x(x − 1) . . . (x − s + 1). Depending on the drawn multiset

  • f white/black balls we add/remove balls.

CHEN AND WEI 2005: Generalized P´

  • lya urn

MAHMOUD 2008: Tenable balanced linear urns (m = 2). RENLUND 2010: Stochastic approximation for tenable urns.

AofA 2013, Menorca 9/26

slide-19
SLIDE 19

Urn models with multiple drawings

  • lya urn: M =

c c

  • , c ∈ N.

Generalization: If we draw {WkSm−k} we add k · c white and (m − k) · c black balls, with c ∈ N. (m + 1) × 2-matrix

M =       mc (m − 1)c c . . . . . . c (m − 1)c mc      

Urn is balanced Tn = Wn + Bn = nmc + T0.

AofA 2013, Menorca 10/26

slide-20
SLIDE 20

Urn models with multiple drawings

  • lya urn: M =

c c

  • , c ∈ N.

Generalization: If we draw {WkSm−k} we add k · c white and (m − k) · c black balls, with c ∈ N. (m + 1) × 2-matrix

M =       mc (m − 1)c c . . . . . . c (m − 1)c mc      

Urn is balanced Tn = Wn + Bn = nmc + T0.

AofA 2013, Menorca 10/26

slide-21
SLIDE 21

Urn models with multiple drawings

Friedman urn: M =

c c

  • , c ∈ N.

Generalization: If we draw {WkSm−k} we add (m − k) · c white and k · c black balls, with c ∈ N. (m + 1) × 2-matrix

M =         mc c (m − 1)c . . . . . . (m − 1)c c mc        

AofA 2013, Menorca 11/26

slide-22
SLIDE 22

Urn models with multiple drawings

Friedman urn: M =

c c

  • , c ∈ N.

Generalization: If we draw {WkSm−k} we add (m − k) · c white and k · c black balls, with c ∈ N. (m + 1) × 2-matrix

M =         mc c (m − 1)c . . . . . . (m − 1)c c mc        

AofA 2013, Menorca 11/26

slide-23
SLIDE 23

Urn models

  • Results
slide-24
SLIDE 24

Urn models

  • Results
slide-25
SLIDE 25

Urn models with multiple drawings

Theorem (CHEN AND WEI 2005) For the generalized P´

  • lya urn the number of white balls Wn after n

draws satisfies Wn = Wn Tn

  • a. s.

− − → W∞; W∞ is absolutely continuous. Questions (CHEN AND WEI): (1) Is W∞ beta-distributed? (2) Explicit results concerning Wn and W∞;

AofA 2013, Menorca 13/26

slide-26
SLIDE 26

Urn models with multiple drawings

Theorem (CHEN AND WEI 2005) For the generalized P´

  • lya urn the number of white balls Wn after n

draws satisfies Wn = Wn Tn

  • a. s.

− − → W∞; W∞ is absolutely continuous. Questions (CHEN AND WEI): (1) Is W∞ beta-distributed? (2) Explicit results concerning Wn and W∞;

AofA 2013, Menorca 13/26

slide-27
SLIDE 27

Urn models with multiple drawings

Theorem (CHEN AND K.) The expectation and the variance of Wn are given by E(Wn) = W0

T0 (nmc + T0), and V(Wn) = E(W2 n) − E(Wn)2 via

E(W2

n) =

n−1+λ1

n

n−1+λ2

n

  • n−1+ T0

mc

n

n−1+ T0−1

mc

n

  • W2

+ W0c2m T0

n−1

  • ℓ=0

ℓ + T0−m

mc

ℓ + T0−1

mc

ℓ+ T0

mc

ℓ+1

ℓ+ T0−1

mc

ℓ+1

  • ℓ+λ1

ℓ+1

ℓ+λ2

ℓ+1

  • ,

with λ1, λ2 given by λ1,2 = −1

2 + mc + T0 ± 1 2

  • 1 + 4mc(1 + c)

mc

.

AofA 2013, Menorca 14/26

slide-28
SLIDE 28

Urn models with multiple drawings

Theorem (CHEN AND K.) For s 1 the moment E(Ws

n) is given by

E(Ws

n) =

n−1

  • j=0

αj,s

  • ·
  • Ws

0 + n−1

  • ℓ=0

βℓ,s ℓ

j=0 αj,s

  • ,

with αn,s, βn,s determined by αn,s =

s

  • ℓ=0

cℓ s

m

  • Tn

, βn,s =

s

  • i=2

E(Ws+1−i

n

)

s

  • ℓ=i

s ℓ

  • cℓ

  • j=ℓ+1−i

(−1)j+i−ℓ−1 ℓ

j

  • j

ℓ+1−i

m

j

  • Tn

j

  • .

Here n

k

  • and

n

k

  • denote the Stirling numbers of the first and

second kind, respectively.

AofA 2013, Menorca 15/26

slide-29
SLIDE 29

Urn models with multiple drawings

Proof:

Wn

(d)

= Wn−1+c·ξn, ξn

(d)

= Hypergeometric(m, Wn−1, Bn−1); in other words: P

  • ξn = k | Fn−1
  • = (

Wn−1 k )( Tn−1−Wn−1 m−k

) (Tn−1

m )

.

Hence, E(Ws

n|Fn−1) = Ws n−1+ s

  • ℓ=1

s ℓ

  • Ws−ℓ

n−1cℓ m

  • k=1

kℓ· Wn−1

k

Tn−1−Wn−1

m−k

  • Tn−1

m

  • ,

By Vandermonde’s identity we obtain a recurrence E(Ws

n) = αn−1,s · E(Ws n−1) + βn−1,s,

n, s 1, (1) which leads to the stated result.

AofA 2013, Menorca 16/26

slide-30
SLIDE 30

Urn models with multiple drawings

Proof:

Wn

(d)

= Wn−1+c·ξn, ξn

(d)

= Hypergeometric(m, Wn−1, Bn−1); in other words: P

  • ξn = k | Fn−1
  • = (

Wn−1 k )( Tn−1−Wn−1 m−k

) (Tn−1

m )

.

Hence, E(Ws

n|Fn−1) = Ws n−1+ s

  • ℓ=1

s ℓ

  • Ws−ℓ

n−1cℓ m

  • k=1

kℓ· Wn−1

k

Tn−1−Wn−1

m−k

  • Tn−1

m

  • ,

expand kℓ = ℓ

j=1

j

  • kj.

By Vandermonde’s identity we obtain a recurrence E(Ws

n) = αn−1,s · E(Ws n−1) + βn−1,s,

n, s 1, (1) which leads to the stated result.

AofA 2013, Menorca 16/26

slide-31
SLIDE 31

Urn models with multiple drawings

Proof:

Wn

(d)

= Wn−1+c·ξn, ξn

(d)

= Hypergeometric(m, Wn−1, Bn−1); in other words: P

  • ξn = k | Fn−1
  • = (

Wn−1 k )( Tn−1−Wn−1 m−k

) (Tn−1

m )

.

Hence, E(Ws

n|Fn−1) = Ws n−1+ s

  • ℓ=1

s ℓ

  • Ws−ℓ

n−1cℓ m

  • k=1

kℓ· Wn−1

k

Tn−1−Wn−1

m−k

  • Tn−1

m

  • ,

By Vandermonde’s identity we obtain a recurrence E(Ws

n) = αn−1,s · E(Ws n−1) + βn−1,s,

n, s 1, (1) which leads to the stated result.

AofA 2013, Menorca 16/26

slide-32
SLIDE 32

Urn models with multiple drawings

Proof:

Wn

(d)

= Wn−1+c·ξn, ξn

(d)

= Hypergeometric(m, Wn−1, Bn−1); in other words: P

  • ξn = k | Fn−1
  • = (

Wn−1 k )( Tn−1−Wn−1 m−k

) (Tn−1

m )

.

Hence, E(Ws

n|Fn−1) = Ws n−1+ s

  • ℓ=1

s ℓ

  • Ws−ℓ

n−1cℓ m

  • k=1

kℓ· Wn−1

k

Tn−1−Wn−1

m−k

  • Tn−1

m

  • ,

By Vandermonde’s identity we obtain a recurrence E(Ws

n) = αn−1,s · E(Ws n−1) + βn−1,s,

n, s 1, (1) which leads to the stated result.

AofA 2013, Menorca 16/26

slide-33
SLIDE 33

Urn models with multiple drawings

Corollary (CHEN AND K.) The limits limn→∞ E(Ws

n/ns) exist and can be recursively

calculated: limn→∞

E(Wn) n

= W0mc

T0

, and

lim

n→∞

E(W2

n)

n2 = Γ( T0

mc)Γ( T0−1 mc )

Γ(λ1)Γ(λ2) ×

  • W2

0 + W0c2m

T0

  • ℓ=0

ℓ + T0−m

mc

ℓ + T0−1

mc

ℓ+ T0

mc

ℓ+1

ℓ+ T0−1

mc

ℓ+1

  • ℓ+λ1

ℓ+1

ℓ+λ2

ℓ+1

  • .

AofA 2013, Menorca 17/26

slide-34
SLIDE 34

Urn models with Multiple Drawings

Another model

(CHEN AND K.): draw m 1 balls with replacement,

p{k times white, (m−k) times black } =

1

(b + w)m m k

  • wkbm−k

Sampling scheme influences the (limiting) distribution. Theorem The expected value coincides: E(Wn) = W0

T0 (nmc + T0); but for the

second moment E(W2

n) =

n−1+µ1

n

n−1+µ2

n

  • n−1+ T0

mc

n

2

  • W2

0 + W0c2m

T0

n−1

  • ℓ=0

ℓ+ T0

mc

ℓ+1

2 ℓ+µ1

ℓ+1

ℓ+µ2

ℓ+1

  • where the values µ1, µ2 are given by µ1,2 = T0+mc±c√m

mc

.

AofA 2013, Menorca 18/26

slide-35
SLIDE 35

Urn models with multiple drawings

Friedman urn: M =

   mc . . . . . . mc    We obtain for both sampling schemes a unified result. Theorem (MAHMOUD, PANHOLZER AND K.) The number of white balls Wn after n draws satisfies Wn n

(a.s.)

− − − − → cm

2 ,

n → ∞. Furthermore, Wn − 1

2cmn − 1 2T0

√n

(d)

− − → N

  • 0, 1

12c2m

  • ,

with convergence of all moments.

AofA 2013, Menorca 19/26

slide-36
SLIDE 36

Urn models

  • Multiple drawings

Analytic combinatorics

slide-37
SLIDE 37

Urn models

  • Multiple drawings

Analytic combinatorics

slide-38
SLIDE 38

Analysis using Analytic Combinatorics

General model:

M =        a0 b0 a1 b1

. . . . . .

am−1 bm−1 am bm       

.

Draw a multiset {WkSm−k} : we add ak white and bk black balls.

AofA 2013, Menorca 21/26

slide-39
SLIDE 39

Analysis using Analytic combinatorics

Case m = 1: draw a single ball 2005 FLAJOLET, GABARR ´

O AND PEKARI: first order PDE for

balanced urns 2006 DUMAS, FLAJOLET AND PUYHAUBERT: differential systems for balanced urns 2010-2011 FLAJOLET AND MORCRETTE: AC for unbalanced urns 2013 MORCRETTE: first order PDE for unbalanced urns! Case m = 2: July 2010 FLAJOLET Second order PDE for Bernoulli-Laplace urn

AofA 2013, Menorca 22/26

slide-40
SLIDE 40

Analysis using Analytic combinatorics

Balanced urns: M =        a0 b0 a1 b1

. . . . . .

am−1 bm−1 am bm        , σ = ai + bi. Approach

  • f DUMAS, FLAJOLET AND PUYHAUBERT: Study urn histories using

differential operators: ∂z: differential operator with respect to z; Θz = z · ∂z. Assume we have w white and b black balls = ⇒ xwyb: ym−k∂m−k

y

xk∂k

x(xwyb) =

xwyb (b + w)m m k

  • wkbm−k,

Θk

xΘm−k y

(xwyb) = xwyb (b + w)m m k

  • wkbm−k.

AofA 2013, Menorca 23/26

slide-41
SLIDE 41

Analysis using Analytic combinatorics

We introduce the differential operators DM =

m

  • k=0

m k

  • xak+kybk+m−kxkym−k∂k

x∂m−k y

,

and DR =

m

  • k=0

m k

  • xakybkΘk

xΘm−k y

.

Proposition Starting with W0 white and B0 black balls the generating function

  • f all urn histories H(x, y; z) =

n0 DnxW0yB0 zn (n!)m satisfies

D ∗ H(x, y, z) = 1 zΘm

z ∗ H(x, y, z),

with D = DM (without replacement) or D = DR (with replacement). Further simplifications using Θx + Θy = W0 + B0 + σΘz.

AofA 2013, Menorca 24/26

slide-42
SLIDE 42

Analysis using Analytic combinatorics

Outlook

Similar results for diminishing urn models; some second order PDEs are explicitly solvable (reduction to first order): M =

  • −1 0

−1 0 −1

  • . M =
  • −1 0

−1 −1 −1

  • , M =
  • −1 0

−1 0 1 −2

  • , M =
  • −1 0

−1 1 −2

  • ,

M =

  • −2 0

−1 0 −2

  • , M =

1 0

1 0 0 1

  • . . .

explicit results, moments, limit laws, . . . Approach of Morcrette ⇒ higher order PDE for unbalanced urns with multiple drawings. . . Solvable higher order PDEs stemming from urn models

AofA 2013, Menorca 25/26

slide-43
SLIDE 43

Thanks for your attention!

AofA 2013, Menorca 26/26

slide-44
SLIDE 44

Thanks for your attention!

AofA 2013, Menorca 26/26