Log In
2 votes
Provide short answers to the following questions:

$P_{n} (t)$ is the probability of $n$ events occurring during a time interval $t$. How will you express $P_{0} (t + h)$ in terms of $P_{0} (h)$, if $P_{0} (t)$ has stationary independent increments? (Note: $P_{t} (t)$is the probability density function).
in Probability
edited by

1 Answer

1 vote
Best answer

$P_0(t)$ denote the probability that no events happened in an interval of length $t.$$$P_0(t + h) = P_0(t) P_0(h)$$ This is because if there are no events in interval $[0,t+h]$ then there are no events in intervals 

  1. $[0,t]$
  2. $[t, t+h]$

These two intervals are non overlapping and it is given in question that $P_0(t)$ has stationary independent increments and so their probabilities are independent.

PS: One of the axioms of Poisson distribution is that the numbers of events in two nonoverlapping regions are independent.

selected by
What does stationary independent increment mean here?

Related questions

4 votes
1 answer
Answer the following: Which of the following statements are FALSE? For poisson distribution, the mean is twice the variance. In queuing theory, if arrivals occur according to poisson distribution, then the inter-arrival time is exponentially distributed. The ... the time between successive arrivals is exponential, then the time between the occurences of every third arrival is also exponential.
asked Nov 27, 2016 in Probability makhdoom ghaya 543 views
14 votes
1 answer
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing? Passing an expression as a parameter Passing an array as a parameter Passing a pointer as a parameter Passing as array element as a parameter
asked Jan 22, 2016 in Compiler Design Cruise Device 1.9k views
0 votes
0 answers
Provide short answers to the following questions: Consider the following sequence of UNIX commands: grep main a.c b.c c.c > grepout & wc < grepout & rm grepout & Why is this not equivalent to the following? grep main a.c.b.c c.c | wc
asked Dec 1, 2016 in Operating System makhdoom ghaya 174 views
17 votes
2 answers
Provide short answers to the following questions: Disk requests come to disk driver for cylinders $10, 22, 20, 2, 40, 6$ and $38$, in that order at a time when the disk drive is reading from cylinder $20$. The seek time is $6$ msec per cylinder. Compute the total seek time if the disk arm scheduling algorithm is. First come first served. Closest cylinder next.
asked Dec 1, 2016 in Operating System makhdoom ghaya 1.7k views