MAS-1

Question 1

Absorbing

Answer 1

State that cannot be left once it is entered

Question 2

Accessible

Answer 2

State that can be entered from another state

Question 3

Communicating

Answer 3

Two states are accessible to each other

Question 4

Class

Answer 4

A set of communicating states

Question 5

Irreducible

Answer 5

A chain with only one class

Question 6

Recurrent

Answer 6

Probability of re-entering state is 1

Question 7

Transient

Answer 7

Probability of re-entering state is less than 1

Question 8

Positive recurrent

Answer 8

Finite expected # of transitions for a chain to return to a state given it started in that state.

Question 9

Null recurrent

Answer 9

Infinite expected # of transitions for a chain to return to a state given it started in that state.

Question 10

Aperiodic

Answer 10

A chain that has limiting probabilities

Question 11

Periodic

Answer 11

A chain that does not have limiting probabilities

Question 12

Canonical Link for Normal

Answer 12

Identity

Question 13

Canonical Link for Binomial

Answer 13

Logit

Question 14

Canonical Link for Poisson

Answer 14

Log

Question 15

Canonical Link for Gamma

Answer 15

Inverse

Question 16

Canonical Link for Inverse Gaussian

Answer 16

Inverse Squared