Alternative combinatorial sum for the probability mass function of the Poisson distribution of order k

Abstract

Kostadinova and Minkova published an expression for the probability mass function (pmf) of the Poisson distribution of order k, as a combinatorial sum (Pliska~Stud.~Math.~Bulgar.\ 22,\ 117-128\ (2013)). Inspired by their elegant solution, this note presents an alternative combinatorial sum for the pmf of the Poisson distribution of order k. The terms are partitioned into blocks of length k (as opposed to k+1 by Kostadinova and Minkova). The new sum offers an advantage in the following sense. For n∈[rk+1,(r+1)k], the lowest power of λ in the pmf is λr+1. Hence the lower limit of summation can be increased, to avoid needlessly calculating terms which cancel to identically zero.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…