LAISHA
Open Laisha

CSIR-UGC NET Stochastic Processes: practice questions

CSIR-UGC NET - Mathematical Sciences (statistics option) · India · National Testing Agency for CSIR

Original practice questions written to the published syllabus · not past papers
10worked here, free
38written to this exam in this subject
11syllabus units

About CSIR-UGC NET

CSIR-UGC NET - Mathematical Sciences (statistics option) is a PhD, fellowship and lectureship exam run by National Testing Agency for CSIR, for candidates in India. Computer-based, 3 hours, Parts A (general aptitude), B and C (subject); statisticians answer from the statistics unit.

Official site: csirnet.nta.ac.in.

We have not been able to confirm these details against the exam body's own specification, so fees, dates and pass marks are left out on purpose. Check the current format, eligibility, fees and dates on the official site.

Stochastic Processes in CSIR-UGC NET

Random processes in time: Markov chains and their classification and limits, Poisson and birth-death processes, branching processes and Brownian motion, applied to population growth, epidemics, queues and weather sequences such as wet- and dry-day chains.

Our 38 CSIR-UGC NET questions in this subject: 0 easy, 16 medium, 22 hard, across 11 units.

10 practice questions, worked

Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.

These 10 were written to CSIR-UGC NET and are not shown on any other exam's page.

Question 1 · medium

How is a process whose next value depends on its last two values made into a Markov chain?

  1. It cannot be made Markov
  2. Enlarge the state
  3. By differencing the series
  4. By ignoring the earlier value
Answer and working

B. Enlarge the state

Enlarging the state to the last two values gives a first-order Markov chain on pairs; this is how second-order rainfall chains are handled.

Question 2 · medium

Which criterion characterises a recurrent state i?

  1. Σₙ pᵢᵢ⁽ⁿ⁾ = ∞
  2. Σₙ pᵢᵢ⁽ⁿ⁾ < ∞
  3. pᵢᵢ⁽ⁿ⁾ → 1
  4. pᵢᵢ = 1
Answer and working

A. Σₙ pᵢᵢ⁽ⁿ⁾ = ∞

The expected number of returns, Σₙ pᵢᵢ⁽ⁿ⁾, is infinite for recurrent and finite for transient states. pᵢᵢ = 1 defines an absorbing state, a special recurrent case.

Question 3 · hard

According to Pólya's theorem, in which dimensions is the symmetric simple random walk recurrent?

  1. All dimensions
  2. One dimension only
  3. Three or more only
  4. One and two dimensions only
Answer and working

D. One and two dimensions only

The return probability is 1 in dimensions 1 and 2 and below 1 in dimensions 3 and higher.

Question 4 · medium

Which statement holds for every finite irreducible Markov chain?

  1. All states are null recurrent
  2. All states are aperiodic
  3. All states are positive recurrent
  4. All states are transient
Answer and working

C. All states are positive recurrent

A finite chain must have a recurrent state, and in an irreducible chain recurrence is shared, with finite mean return times. Aperiodicity is not guaranteed (the alternating chain).

Question 5 · hard

For an absorbing chain with transient-to-transient block Q and transient-to-absorbing block R, which matrix gives the absorption probabilities?

  1. (I − Q)⁻¹R
  2. (I − Q)⁻¹1
  3. (I − R)⁻¹Q
  4. QR
Answer and working

A. (I − Q)⁻¹R

N = (I − Q)⁻¹ is the fundamental matrix of expected visits; NR gives absorption probabilities and N1 the expected times to absorption.

Question 6 · hard

A periodic irreducible positive-recurrent chain has stationary distribution π. Which statement is correct?

  1. No stationary distribution exists for periodic chains
  2. π depends on the starting state
  3. Long-run time fractions equal π, though pᵢⱼ⁽ⁿ⁾ itself does not converge
  4. pᵢⱼ⁽ⁿ⁾ converges to πⱼ as in the aperiodic case
Answer and working

C. Long-run time fractions equal π, though pᵢⱼ⁽ⁿ⁾ itself does not converge

Periodicity prevents convergence of n-step probabilities, but averages over time still converge to π (the ergodic theorem needs no aperiodicity).

Question 7 · medium

A Yule process (each individual splits at rate λ) starts from one individual. What is E[X(t)]?

  1. e^(λt)
  2. λt
  3. e^(−λt)
  4. 1 + λt
Answer and working

A. e^(λt)

X(t) is geometric with success probability e^(−λt), so its mean is e^(λt): exponential growth.

Question 8 · hard

Each infected plant infects a Poisson number of others with mean 2. What is the probability that an outbreak from one infected plant dies out?

  1. 1.000
  2. 0.135
  3. 0.500
  4. 0.203
Answer and working

D. 0.203

q solves q = e^(2(q−1)); iterating gives q ≈ 0.203. e^(−2) = 0.135 is only the chance of no secondary infections.

Question 9 · hard

What does the Pollaczek-Khinchine formula for the M/G/1 queue show?

  1. Service times must be exponential
  2. Waiting depends only on the mean service time
  3. The queue is stable for any ρ
  4. Service variability lengthens queues
Answer and working

D. Service variability lengthens queues

Lq = (λ²σ² + ρ²)/[2(1 − ρ)]: for a fixed mean, more variable service gives longer queues; deterministic service halves Lq compared with exponential.

Question 10 · medium

What is the probability that standard Brownian motion reaches level 2 at some time before t = 4?

  1. 0.159
  2. 0.617
  3. 0.309
  4. 0.317
Answer and working

D. 0.317

Reflection principle: 2P(W(4) ≥ 2) = 2[1 − Φ(2/√4)] = 2[1 − Φ(1)] = 0.317. P(W(4) ≥ 2) alone = 0.159.

A study plan for Stochastic Processes in CSIR-UGC NET

This plan follows where our questions actually fall, so the time goes where the marks are likely to be. It is our reading of the syllabus, not the exam body's weighting.

  1. First, the heavy units (53% of the 38 questions): Brownian motion and its basic properties (5, 13%); Classification of states and periodicity (5, 13%); Definition and classification of stochastic processes (5, 13%); Renewal processes (introduction) (5, 13%).

    Read the manual chapters for these first and do every worked question you can find on them.

  2. Then the middle band: Branching processes and extinction probability (4, 11%); Limiting and stationary distributions (4, 11%); Pure birth, pure death and birth-death processes (3, 8%); Markov chains: transition matrices and Chapman-Kolmogorov equations (2, 5%).

    Aim for one sitting per unit, then mixed questions across them.

  3. Then the lighter units: Markov-chain models of rainfall and crop sequences (2, 5%); Poisson process and its properties (2, 5%); Queueing models M/M/1 and M/M/c (1, 3%).

    Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.

  4. Leave time for the hard ones: Queueing models M/M/1 and M/M/c (1 hard of 1), Branching processes and extinction probability (3 hard of 4), Limiting and stationary distributions (3 hard of 4).

    Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.

  5. Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.

Last updated · How Laisha writes and checks its pages · Report a mistake

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.

Unlock every question — CSIR-UGC NET Stochastic Processes

US$10 a month · one price worldwide · cancel any time

  • Every practice question in this subject, with full working
  • Timed exam papers and progress by unit
  • Ask Laisha to explain any answer — up to 1,000 questions a month
Free or Smarter
FreeSmarter
Grow guides, pest pages, articlesRead allRead all
Ask Laisha5 a dayUp to 1,000 a month
Exam practiceThe sample on each pageEvery question, timed papers
Crop calendar and pest alerts—For your own fields
Calculators and tools—All
Uploads and reports—100 a month, real files
10 days free for every new account, no card.