Understanding the Characteristic Function in Solving Poisson Process Problems

In summary, the characteristic function of the time to the first green arrival is an exponential function with waiting time.
  • #1
JohanL
158
0

Homework Statement


Insects land in the soup in the manner of a Poisson process with intensity lambda. Insects are green with probability p, independent of the color of the other insects. Show that the arrival of green insects is a Poisson process with intensity p*lambda.

Homework Equations

3. The solution
Im only interested in one step of the solution. Our professor started out calculating the characteristic function of an exponential random variable.

"We solve this by checking that the times, call one such typical time T, between arrivals of new green insects are exp(p*lambda) - distributed"

$$E[e^{j\omega\exp(\lambda)}] = ... = \frac{\lambda}{\lambda - j\omega}$$

Its the next step that is confusing me

$$E[e^{j\omega\exp(T)}] = \sum_{n=1}^\infty (\frac{\lambda}{\lambda - j\omega})^n p(1-p)^n$$

What is he doing here?

I understand that he is dividing the event into a disjoint sum of events and that the characteristic function of a sum of independent variables is the product of the characteristic functions of the variables but still don't understand what the nth power of a characteristic function is doing there. Is the characteristic function of an exponential a waiting time??
 
Last edited:
Physics news on Phys.org
  • #2
JohanL said:

Homework Statement


Insects land in the soup in the manner of a Poisson process with intensity lambda. Insects are green with probability p, independent of the color of the other insects. Show that the arrival of green insects is a Poisson process with intensity p*lambda.

Homework Equations

3. The solution
Im only interested in one step of the solution. Our professor started out calculating the characteristic function of an exponential random variable.

"We solve this by checking that the times, call one such typical time T, between arrivals of new green insects are exp(p*lambda) - distributed"

$$E[e^{j\omega\exp(\lambda)}] = ... = \frac{\lambda}{\lambda - j\omega}$$

Its the next step that is confusing me

$$E[e^{j\omega\exp(T)}] = \sum_{n=1}^\infty (\frac{\lambda}{\lambda - j\omega})^n p(1-p)^n$$

What is he doing here?

I understand that he is dividing the event into a disjoint sum of events and that the characteristic function of a sum of independent variables is the product of the characteristic functions of the variables but still don't understand what the nth power of a characteristic function is doing there. Is the characteristic function of an exponential a waiting time??
If ##X_1, X_2, \ldots## are independent, exponentially-distributed random variables with rate parameter ##\lambda##, the time (##T##) to the first green arrival is
[tex] T = \sum_{i=1}^N X_i, [/tex]
where ##N## is a geometric-distributed random variable with parameter ##p##. Here, ##N## and all the ##X_i## are independent. Note that ##P(N = n) = p (1-p)^{n-1}, \; n = 1,2,3, \ldots##. In more detail:
[tex] \begin{array}{lcl}T = X_1& \text{if}& N = 1\\
T = X_1 + X_2 &\text{if}& N = 2 \\
T = X_1 + X_2 + X_3 &\text{if}& N = 3\\
\hspace{3em}\vdots & \vdots &\hspace{1em} \vdots
\end{array}
[/tex]
We have that ##N = 1## if the first arrival is green, ##N = 2## if the first arrival is non-green and the second is green, ##N = 3## if the first two arrivals are non-green and the third is green, etc.The characteristic function of ##T## is ##C_T(\omega) = E e^{j \omega T}##. We have

[tex] \begin{array}{rcl}E e^{j \omega T}& =& \sum_{n=1}^{\infty} P(N = n) E \left[ e^{j \omega T} | N = n \right] \\

&=& \sum_{n=1}^{\infty} P(N = n) E \left[ e^{j \omega (X_1 + X_2 + \cdots + X_n)} | N = n\right] \\
&= & \sum_{n=1}^{\infty} P(N = n) E \left[ e^{j \omega (X_1 + X_2 + \cdots + X_n)} \right]
\end{array} [/tex]
This last step holds because, for each given ##n##, the random variables ##X_1, X_2, \ldots ## are independent of the event ##\{N = n \}##.

Since you say you know that the ch. fcn. of a sum of independent r.v.s is the product of their ch. fcns., you should know that
[tex] E \left[ e^{j \omega (X_1 + X_2 + \cdots + X_n)} \right] = \left( E \,e^{ j \omega X} \right)^n, [/tex]
where ##X## is anyone of the identically-distributed ##X_i##.

You end up with
[tex] E\,e^{j \omega T} = \sum_{n=1}^{\infty} p (1-p)^{n-1} \left( \frac{\lambda}{\lambda - j \omega} \right)^n [/tex]
This is the formula you want, except it has the correct ##(1-p)^{n-1}## instead of the incorrect ##(1-p)^n## in the sum.
 
Last edited:
  • Like
Likes JohanL
  • #3
Thanks! I understand it now!
 

What is a Poisson process?

A Poisson process is a type of stochastic process that models the occurrence of random events over time. It is characterized by a constant rate of occurrence and independent events. It is often used to model phenomena such as radioactive decay, natural disasters, and customer arrivals in a queue.

What is the "thinning" of a Poisson process?

The "thinning" of a Poisson process refers to the process of reducing the rate of occurrence of events in a Poisson process. This can be achieved by either removing some events from the process entirely or by reducing the rate of occurrence for certain events.

What are some applications of thinning in Poisson processes?

Thinning in Poisson processes has several applications in different fields. In finance, it can be used to model the arrival of trades in a financial market. In biology, it can be used to model the growth of a population with a limited carrying capacity. In telecommunications, it can be used to model the arrival of messages in a communication network.

How is thinning implemented in a Poisson process?

There are several methods for implementing thinning in a Poisson process. One common method is to use a thinning algorithm, which randomly removes events from the original process according to a predetermined probability. Another method is to use a thinning function, which adjusts the rate of occurrence for each event based on a predetermined function.

What are the advantages of using thinning in a Poisson process?

Thinning in Poisson processes can help to more accurately model real-world phenomena by taking into account factors such as limited resources or external influences. It can also make the process more computationally efficient by reducing the number of events that need to be simulated. Additionally, thinning allows for more flexibility in modeling different scenarios and can provide insights into the underlying dynamics of the process.

Similar threads

  • Calculus and Beyond Homework Help
Replies
8
Views
679
  • Calculus and Beyond Homework Help
Replies
10
Views
988
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
32
Views
2K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
2
Replies
56
Views
3K
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
12
Views
2K
Back
Top