Loyola College B.Sc. Statistics April 2004 Applied Stochastic Processes Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI –600 034

B.Sc., DEGREE EXAMINATION – STATISTICS

  FIFTH SEMESTER – APRIL 2004

ST 5400/STA 400 – APPLIED STOCHASTIC PROCESSES

17.04.2004                                                                                                           Max:100 marks

1.00 – 4.00

 

SECTION -A

 

Answer ALL questions.                                                                              (10 ´ 2 = 20 marks)

 

  1. Define a Stochastic Process.
  2. What is ‘State Space’ of a Stochastic Process?
  3. Define ‘Counting Process’.
  4. Explain ‘Independent Increments’.
  5. Define ‘Markor Process’.
  6. Define ‘Transition Probability Matrix’.
  7. Define ‘accessibility’ of a state from another.
  8. If  is a stochastic matrix,

fill up the missing entries in the matrix.

  1. Define ‘Aperiodic’ Markov chain.
  2. Write down the postulates of ‘Pure Birth Process’.

 

SECTION – B

 

Answer any FIVE questions.                                                                                     (5 ´ 8 = 40 marks)

 

  1. State the classifications of Stochastic Processes based on time and state space. Give an example for each type.
  2. Show that a sequence of independent random variables is a Markov Chain (M.C).
  3. If and the TPM is

,  find P (X2 = 2).

 

  1. Show that ‘Communication’ is an equivalence relation.

 

 

 

 

 

 

 

  1. Classify the states of a M.C. whose TPM is

 

0        1        2     3      4

 

  1. Describe a one-dimensional Random walk and write down its TPM.

 

  1. State and prove any one property of a Poisson Process.

 

  1. Write brief notes on: (a) Stochastic and Doubly Stochastic Matrices; (b) Extensions of Poisson Process.

 

SECTION – C

 

Answer any TWO questions.                                                                       (2 ´ 20 = 40 marks)

 

  1. a) Let { X(t) : t Î T} be a process with stationary independent increments where

T =  {0,1,2, ….}.   Show that the process is a Markov Process.

  1. b) If {Xn : n = 1,2,3, …} is a sequence of i.i.d, r.v.s and Sn = n = 1,2,…., show that

{Sn} is an M.C.                                                                                                  (10+10)

 

  1. a) Define ‘recurrent’ and ‘transisiant’ states. State (without proof) a necessary and

sufficient condition for a state to be recurrent.

  1. b) Describe the two-dimensional random walk. Discuss the recurrence of the states.

(6+14)

  1. State the posulates of a Poisson Process and derive the distribution of X(t).

 

  1. a) Define a ‘Martingale’.

If Yo = 0, Y1, Y2, …., are i.i.d with E (Yn) = 0, V (Yn) = s2, show that:

  1. b) Xn = is a Martingale with respect to {Yn}
  2. c) Xn = – n s2 is a Martingale with respect to {Yn}.                               (3+7+10)

 

 

Go To Main page

Latest Govt Job & Exam Updates:

View Full List ...

© Copyright Entrance India - Engineering and Medical Entrance Exams in India | Website Maintained by Firewall Firm - IT Monteur