Concept

Factorial moment

In probability theory, the factorial moment is a mathematical quantity defined as the expectation or average of the falling factorial of a random variable. Factorial moments are useful for studying non-negative integer-valued random variables, and arise in the use of probability-generating functions to derive the moments of discrete random variables. Factorial moments serve as analytic tools in the mathematical field of combinatorics, which is the study of discrete mathematical structures. For a natural number r, the r-th factorial moment of a probability distribution on the real or complex numbers, or, in other words, a random variable X with that probability distribution, is where the E is the expectation (operator) and is the falling factorial, which gives rise to the name, although the notation (x)r varies depending on the mathematical field. Of course, the definition requires that the expectation is meaningful, which is the case if (X)r ≥ 0 or E[|(X)r|] < ∞. If X is the number of successes in n trials, and pr is the probability that any r of the n trials are all successes, then If a random variable X has a Poisson distribution with parameter λ, then the factorial moments of X are which are simple in form compared to its moments, which involve Stirling numbers of the second kind. If a random variable X has a binomial distribution with success probability p ∈ and number of trials n, then the factorial moments of X are where by convention, and are understood to be zero if r > n. If a random variable X has a hypergeometric distribution with population size N, number of success states K ∈ {0,...,N} in the population, and draws n ∈ {0,...,N}, then the factorial moments of X are If a random variable X has a beta-binomial distribution with parameters α > 0, β > 0, and number of trials n, then the factorial moments of X are The rth raw moment of a random variable X can be expressed in terms of its factorial moments by the formula where the curly braces denote Stirling numbers of the second kind.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.