Bartlett's theorem

A Poisson-arrival occupancy theorem for independently moving individuals in a system's regions.

Version

v1 · 2026-09-28 · History

Domain-specific #

8119

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Applied Probability → Mathematics

Core Idea

Bartlett's theorem is an occupancy law for Poisson arrivals whose members evolve independently. Fix a region and observation time. For each possible arrival age, multiply the inflow rate by the chance that an entrant remains in that region, then integrate. The resulting number of individuals is Poisson, and counts in disjoint regions are independent. Kelly and Yudovina give the empty-initial-system formulation and proof; it is stronger than calculating only an expected headcount.

The theorem's one-region infinite-server special case can inform service planning. Garrison and Pecina applied a Poisson-arrival, independent-stay model to a hospital family-medicine service and used λE(B) to predict census. Its 7.44 predicted mean was below the observed 7 a.m. 8.28, reminding readers that a model's conditional theorem does not validate its premises in every real system. Finite beds, shared constraints, time-of-day sampling, or correlated arrivals can matter.

How would you explain it like I'm…

The Random Park Visitors

People wander into a big park at random times, and each one walks around on their own, not following anybody. You can't know exactly how many will be at the playground right now, but Bartlett's theorem tells you exactly how likely each number is, using only how often people arrive and how likely each one is to be at the playground. And the number at the playground has nothing to do with the number at the pond.

Random Arrivals, Random Counts

Suppose visitors arrive at random, like raindrops starting to fall, and once inside each one moves around independently. Bartlett's theorem says the number of visitors you'd find in some area at a given time follows the same kind of randomness as the arrivals, a pattern called a Poisson distribution. To get the average, you add up, over all past moments, how often people arrived then times the chance someone who arrived then is in that area now. Counts in separate areas don't affect each other. But the answer is only as good as its assumptions: if visitors come in groups or run out of room, real counts can differ.

Poisson Occupancy Theorem

Bartlett's theorem is about systems where individuals arrive according to a Poisson process, a common model of purely random arrivals, and then each moves or evolves independently of the others. Starting from an empty system, fix a region and a time. The number of individuals in that region is Poisson distributed, and its mean equals the arrival rate multiplied by the probability that an arrival of each age is in that region, added up (integrated) over all possible arrival ages. Counts in regions that don't overlap are independent. This is stronger than just computing an average headcount, because it gives the whole probability distribution. A special case is a queue with unlimited servers, where the number of customers present has mean λE(B), the arrival rate times the average stay; in one hospital study this predicted a mean census of 7.44 against an observed 8.28, a reminder that the premises must fit the real system.

 

Bartlett's theorem is an occupancy law for Poisson arrival streams whose members evolve independently after entering. Starting from an empty system, fix an observation time t and a region A. The number of individuals in A at time t is Poisson distributed with mean ∫ λ(s)·P(an entrant arriving at time s is in A at time t) ds, integrating over arrival times (equivalently, over arrival ages), and the counts in disjoint regions are mutually independent. Kelly and Yudovina give this empty-initial-system formulation and proof, which yields the full distribution and independence structure rather than only an expected headcount. Taking the region to be 'still in service' gives the infinite-server queue: the number present is Poisson with mean λE(B), where B is the service or stay duration. Garrison and Pecina used such a model for a hospital family-medicine service, predicting a mean census of 7.44 against an observed 7 a.m. value of 8.28. That gap illustrates that the theorem is conditional: finite beds, shared constraints, time-of-day sampling, or correlated arrivals violate its premises.

Scope of Application

This is the Poisson-occupancy result in queueing and population models, not Bartlett's statistical test.

• Queueing theory. Predict fixed-time counts in independent-customer networks.
• Population processes. Model independent individuals moving among states.
• Healthcare modeling. Approximate census from admissions and lengths of stay.
• Network planning. Evaluate region-level occupancy under Poisson inflow assumptions.

Clarity

Bartlett's theorem says Poisson arrivals following independent paths give Poisson occupancy in a fixed region and independent counts in disjoint regions. Integrate arrival rate times retention probability to find the mean. A hospital census approximation uses a one-region special case, but finite capacity and observation time can cause mismatch.

Manages Complexity

Poisson input and independent marking preserve the distribution under individual motion, not just the mean. This exact structure disappears when entrants interact or share a binding capacity. The theorem's empty-initial-state, time-dependent statement must also be distinguished from stationary M/G/∞ consequences and empirical approximations.

Abstract Reasoning

Specify inflow, initial state and independent paths; choose region and time; integrate cohort retention; then use the resulting Poisson law only where assumptions and measurement match.

Knowledge Transfer

The Poisson-marking mechanism travels across road, migration, service and communication systems if arrivals and paths satisfy its assumptions. A correlated arrival stream or finite queue with interactions is not a literal instance merely because a Poisson curve roughly fits observed counts.

Relationships to Other Abstractions

Current abstraction Bartlett's theorem Domain-specific

Parents (1) — more general patterns this builds on

• Bartlett's theorem is a kind of Poisson Process Prime

  Bartlett's theorem derives an occupancy law directly from Poisson-arrival, independent-evolution assumptions.

Hierarchy paths (5) — routes to 5 parentless roots

• Bartlett's theorem → Poisson Process → Markov Process → Stochastic Process

Show alternative paths (4)

Neighborhood in Abstraction Space

Bartlett's theorem sits in a moderately populated region (49^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Queueing, Networks & Concurrent Systems (9 abstractions)

Nearest neighbors

• Jackson's Theorem (Queueing Theory) — 0.87
• Lincoln Index — 0.87
• Network mapping — 0.87
• Evacuation Simulation — 0.87
• Reachability analysis — 0.86

Computed from structural-signature embeddings · 2026-10-08