Pointwise optimal kernel bandwidth Created 2026-10-14 Updated 2026-11-05
For a second-order kernel density estimator, if and , the leading pointwise asymptotic mean squared error is . Differentiation gives the displayed interior optimum. At a zero of , the leading variance term vanishes and this two-term approximation has no positive interior minimizer; at a zero of , a higher-order bias expansion is needed.
Poisson arrival time 2026-10-25
The time of the -th event of a Poisson process. At positive rate , the Poisson interarrival times , with , are independent and identically distributed random variables with the rate- exponential distribution. In particular, has expected value and variance . The inverse-count identity is .
Poisson binomial distribution 2026-10-14
The sum of independent Bernoulli random variables with possibly unequal success probabilities has a Poisson binomial distribution. Its probability generating function is : expand the product to read off the probability mass function. Linearity of expectation and additivity of variance for independent random variables give and . Equal recover the binomial distribution.
For three trials with success probabilities , expanding gives masses at . Their expected value is and variance is . Replacing all three success probabilities by their average preserves the expected value but gives binomial distribution variance , so it does not preserve the law.
Poisson count-arrival joint central limit theorem Created 2026-10-25 Updated 2026-10-31
For a rate-one Poisson process with Poisson arrival times , suppose and . Thenwhere and denotes the bivariate normal distribution with standard normal marginal distributions, including the singular cases. In particular, equal scales give and separated scales give .
To prove this, fix real and put for large . The event is exactly . Counts at the two deterministic times are sums of a shared count on and an independent count on the remaining interval. The central limit theorem for a centered Poisson random variable of diverging parameter follows by writing a count at a real time as its count at , a sum of independent unit increments, plus an independent remainder with expected value at most one. Markov's inequality makes that remainder negligible after division by .
Apply this central limit theorem to the two independent count blocks whenever their lengths diverge. A block with bounded length, or length negligible compared with the scale of its coordinate, contributes a term tending to zero in probability. The standardized pair of counts therefore has a joint normal limit whose correlation coefficient isThis includes : the difference block then has negligible variance after normalization. In the arrival event the standardized count at must be at least . Reversing this inequality changes the sign of the second limiting normal random variable, giving the asserted negative correlation coefficient. Continuity of the marginal distributions permits the moving thresholds and the weak inequalities, including at the singular limits.
Every is realized by with , and zero by . Conversely, even when has no limit, it has a subsequence converging in the extended interval . If the original pair has a joint bivariate normal distribution limit, that subsequence has the same limit, forcing its correlation coefficient into .
Poisson counting in a coherent state 2026-10-20
The normalized coherent state has number amplitude , hence the displayed Poisson law with mean and variance . A product of coherent modes has factorized number probabilities.
Poisson cumulative probability at its growing mean Created 2026-10-06 Updated 2026-11-05
If has a Poisson distribution, then as . The Poisson central limit theorem standardizes by mean and variance ; the cutoff tends to zero. Squeezing between fixed nearby cutoffs and using continuity of the standard normal distribution function gives the limit.
Poisson distribution Created 2026-09-24 Updated 2026-10-14
For , a Poisson random variable has probability mass functionThe exponential function series verifies normalization. At , define with certainty. The equality of mean and variance is a distinguishing model property, though it does not by itself characterize the law.
When counting events in a homogeneous Poisson process, distinguish its rate from the distribution parameter: an interval of duration has . A rate measured per minute times a duration measured in minutes gives a dimensionless expected count. This process assumes independent increments, a constant rate, and a negligible chance of multiple events relative to interval length in a sufficiently short interval. A rate alone does not establish a Poisson distribution. See Bertsekas and Tsitsiklis, chapter 6 summary, pages 46-47.
For a constructed arrival model with events per minute over minutes, . The mean and variance are both three, andThe probability of at least one event is . These results describe the specified process, not every arrival mechanism with the same average rate.
The Poisson limit theorem, often called the law of rare events, connects this law to the binomial distribution. Keep fixed and let for integers . For each fixed nonnegative integer and sufficiently large ,There are more opportunities, each less likely to succeed, while the mean stays and the variance approaches . For , the probability of three successes is at , at , and at , approaching the Poisson distribution value .
The panels show the same count scale and the same Poisson distribution reference. At , is not especially small and the difference is visible. No universal trial-count cutoff guarantees an adequate approximation for every event.
The independence assumption matters even when every success is rare. For , if all indicator random variables equal one shared Bernoulli random variable of parameter , their sum is zero with probability and with probability . Its mean is three, yet its zero-count probability tends to one, not . Some dependent counts still admit approximation through the Stein-Chen method, but this requires additional control of dependence.
For historical orientation, the BnF records Poisson's original probability treatise, Recherches sur la probabilité des jugements, as published in Paris in 1837. This bibliographic fact alone does not establish when the modern distribution terminology arose. See BnF record of Poisson's 1837 treatise.
Poisson mixture Created 2026-10-05 Updated 2026-10-07
A model with for a nonnegative random intensity. Conditional expectation and total variance give and , explaining overdispersion. A Poisson-gamma mixture gives the negative binomial distribution.
Poisson moment closure for a birth-death process Created 2026-09-24 Updated 2026-11-05
Poisson moment closure approximates a nonnegative integer-valued population law at each time by a Poisson distribution with its current mean . Its factorial moments then become ; in particular and .
For example, consider birth rates and death rates , with and . Assuming the relevant moments are finite, the exact first-moment equation isPoisson closure gives the Riccati equation . The exact identity shows what is discarded: the variance correction . Nonlinear rates do not generally preserve a Poisson distribution.
For the Batch-birth linear-death process, a Poisson initial law does remain Poisson. independent survival thins the initial Poisson population, and surviving immigrants form an independent Poisson population; their sum is Poisson. That gives an exact linear example, rather than making the nonlinear closure exact.[ref]
Lectures on the Poisson Process by Günter Last and others. Chapter 5: marking, thinning and superposition
Poisson photon counting 2026-10-20
For independent photon detections with a fixed mean rate, counts in a fixed exposure have a Poisson distribution, so the variance equals the mean. Multiplying by a representative photon energy gives . A source-only signal-to-noise threshold therefore needs an expected photons. Background, detector noise, variable illumination and photon correlations can invalidate that source-only formula.
Poisson point process Created 2026-09-24 Updated 2026-11-05
A Poisson point process is a point process with independent Poisson distribution counts on disjoint measurable sets. Its intensity measure specifies those counts: for ,Thus both the expected value and variance of are . The independence requirement concerns disjoint test sets; overlapping sets can share points and have dependent counts.[ref]
Lectures on the Poisson Process by Günter Last and others. Definition 3.1, Poisson count and disjoint-set independence requirements
For a homogeneous Poisson point process in Euclidean space, , with constant intensity and volume . For example, intensity on the real line gives expected count and empty-interval probability in a unit interval. Counts in two disjoint unit intervals are independent.
The counting measure formulation records multiplicity. A non-atomic intensity measure gives a simple point process, with no coincident points; an atom of a measure can instead carry a random multiplicity. Poisson random measures make that counting formulation explicit, while Poisson thinning theorem and the Superposition theorem for Poisson point processes explain useful ways of constructing related processes.
Poisson process Created 2026-09-24 Updated 2026-10-14
A Homogeneous Poisson process models arrivals at a constant rate . Its counting process counts arrivals in , with . Its paths are right-continuous nondecreasing functions, take nonnegative integer values, and have unit jumps almost surely. The defining Poisson distribution of each increment isIt has stationary increments: the probability distribution above depends on the duration , not the starting time . It also has independent increments: counts in any finite collection of disjoint time intervals are independent random variables. Together these conditions specify the joint count laws, not merely the Poisson distribution at a single time.[ref]
Poisson Processes (Chapter 2). pp. 78-79: counting-process definition and its equivalence to exponential interarrival times
The rate has units of arrivals per unit time; is dimensionless. The Poisson distribution givesFor a toy rate per minute and a duration of minutes, the expected value and variance of the count are both . The probability of no arrival is , and the probability of exactly three is . In two consecutive one-minute intervals, the probability of exactly two arrivals in the first and exactly one in the second is , using independent increments. These are exact model calculations with rounded decimals, not measured frequencies.
Synthetic arrival times and their right-continuous counting path, compared with the exact mean at two arrivals per minute
. Details. The diagram's nine hand-chosen arrivals illustrate a path; the line is an expected value, not a prescribed trajectory. Constant rate does not imply evenly spaced arrivals. Poisson interarrival times connect the count description to waiting, while Poisson thinning explains how independently routing arrivals produces separate streams. This makes the Poisson process useful as a simple arrival model for a queue, provided constant rate and independent increments are plausible. For a deterministic changing rate, use an Inhomogeneous Poisson process; bunching or history-dependent arrivals need additional assumptions. Conditional on , the arrival times are the order statistics of independent uniform distributions on , as developed in Poisson process conditional arrival times.
With , define and . The estimating equation and a Taylor expansion give . If responses are independent with correct means and , then and . Consequently the first-order estimator variance is , even if the working Poisson distribution is wrong. Regular asymptotics require growing information and control of leverage and the Taylor remainder.
In Poisson regression with log means , the Fisher information matrix is , where . Inverting this matrix gives slope variance . Writing reduces it to the displayed reciprocal weighted sum of squares. Thus a common intercept consumes information about the overall rate, while slope information comes from the spread of the covariates under the mean-count weights. Constant covariates make the two parameters unidentifiable.
Poisson variance after sky subtraction 2026-10-20
Subtracting an exactly known mean sky level leaves source-plus-sky variance of a Poisson distribution . If the sky per source pixel is estimated from equal-area, equally exposed independent sky pixels, its additional variance is , so before read and dark terms. The variance of removed background photons does not disappear with their mean.
Polynomial tails prevent exponential tilting Created 2026-10-14 Updated 2026-11-05
If a density has polynomially decaying tails on both half-lines, its moment-generating function is infinite at every nonzero real parameter: exponential growth defeats polynomial decay on the positive tail for a positive parameter, and on the negative tail for a negative parameter. Thus no open real tilting domain exists for a saddlepoint density approximation, even when the distribution has finite mean and variance and a central limit theorem applies.
Population principal component 2026-10-14
The population principal components are centered linear compounds along an orthonormal eigenbasis of the covariance matrix, ordered by decreasing eigenvalue. They are uncorrelated and have variances . Each successive direction maximizes variance subject to unit length and orthogonality to earlier directions. Uncorrelatedness does not imply independence unless additional distributional assumptions hold.
Population variance Created 2026-10-20 Updated 2026-11-05
For a finite population with arithmetic mean , its variance is . It averages squared deviations over the whole population.
Portfolio diversification 2026-10-14
Spreading a portfolio across assets can reduce risk that is not shared by them. For centered asset risks with covariance matrix , the variance of the weighted risk is . Equal weights across independent risks with common variance give variance , whereas equal weights across risks that are all the same random variable leave variance . Thus small individual weights do not by themselves remove common risk; the covariance criterion for diversification of factor residuals identifies sufficient dependence and weight conditions.
Portfolio optimization 2026-11-05
Portfolio optimization chooses asset allocations to optimize an objective under specified constraints. In a one-period mean-variance optimization model, the return vector has mean and covariance matrix . Portfolio weights give expected return and return variance . A standard problem isThe constraints describe a fully invested portfolio, a target expected return and no short selling. Different assumptions produce different optimization problems. Harry Markowitz made the dependence on covariance and the tradeoff between mean and variance central to portfolio selection.[ref]
Portfolio Selection by Harry Markowitz. 1952, printed pages 80–82: weighted returns, covariance, budget and efficient portfolios
For two uncorrelated assets with expected returns and , each with standard deviation , a weight in the first gives variance . Its unconstrained minimum is at , yielding mean and standard deviation . A target of at least instead requires , making the constrained minimum . The same covariance matrix therefore gives a different solution when the objective's feasible set changes.
Estimated means and covariances are model inputs, rather than known future outcomes. Sampling uncertainty, transaction costs and additional allocation restrictions can materially change the resulting weights.

