On the fractional Poisson process and the discretized stable subordinator (Q2422516): Difference between revisions

Summary: We consider the \textit{renewal counting number process} \(N = N(t)\) as a forward march over the non-negative integers with independent identically distributed waiting times. We embed the values of the counting numbers \(N\) in a ``pseudo-spatial'' non-negative half-line \(x \geq 0\) and observe that for physical time likewise we have \(t \geq 0\). Thus we apply the Laplace transform with respect to both variables \(x\) and \(t\). Applying then a modification of the Montroll-Weiss-Cox formalism of continuous time random walk we obtain the essential characteristics of a renewal process in the transform domain and, if we are lucky, also in the physical domain. The process \(t = t(N)\) of accumulation of waiting times is inverse to the counting number process, in honour of the Danish mathematician and telecommunication engineer A. K. Erlang we call it the \textit{Erlang process}. It yields the probability of exactly \(n\) renewal events in the interval \((0, t]\). We apply our Laplace-Laplace formalism to the fractional Poisson process whose waiting times are of Mittag-Leffler type and to a renewal process whose waiting times are of Wright type. The process of Mittag-Leffler type includes as a limiting case the classical Poisson process, the process of Wright type represents the discretized stable subordinator and a re-scaled version of it was used in our method of parametric subordination of time-space fractional diffusion processes. Properly rescaling the counting number process \(N(t)\) and the Erlang process \(t(N)\) yields as diffusion limits the inverse stable and the stable subordinator, respectively.