Answering Questions That Require Multiple Applications of a Transition Matrix (VCE SSCE General Mathematics): Flashcards

📚Flashcards
Answering Questions That Require Multiple Applications of a Transition Matrix
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

10 cards from this deck

Show

Initial state matrix notation and meaning

S0S_0, the starting situation before any transitions

Matrix recurrence relation definition

Formula generating sequence of state matrices over time

General form of matrix recurrence relation

Sn+1=T×SnS_{n+1} = T \times S_n where TT is transition matrix

Meaning of SnS_n in matrix recurrence

State matrix after nn applications of transition matrix

Formula for state after 1 time period

S1=T×S0S_1 = T \times S_0

Explicit rule for finding SnS_n

Sn=Tn×S0S_n = T^n \times S_0

When to use recurrence relation Sn+1=T×SnS_{n+1} = T \times S_n

For a few time steps (like 1, 2, or 3 periods)

When to use explicit rule Sn=Tn×S0S_n = T^n \times S_0

For many time steps (like 20 or 40 periods)

Steady state or equilibrium definition

When populations stabilise; equal movement in both directions

Key characteristic of steady state

Movement continues but net effect is zero change

Join 100,000+ SSCE students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.