Contiguous Events in Probability: Definition and Applications

In probability theory and stochastic processes, contiguous events (or contiguous sequences) describe a specific dependency structure where the occurrence of each event necessitates the next.

Formal Definition

A sequence of events A₁, A₂, ..., Aₙ is contiguous if for every k = 1, 2, ..., n−1:

P(Aₖ₊₁ | Aₖ) = 1

Equivalently: Aₖ ⊆ Aₖ₊₁ (each event is a subset of the next). If Aₖ occurs, Aₖ₊₁ must occur.

Key Implications

• Chain of certainty: P(A₁ ∩ A₂ ∩ ... ∩ Aₙ) = P(A₁). The joint probability equals the first event's probability.
• Nested structure: A₁ ⊆ A₂ ⊆ ... ⊆ Aₙ.
• Contrast with independence: Independent events have P(Aₖ₊₁ | Aₖ) = P(Aₖ₊₁); contiguous events have maximal dependence.

Applications

Reliability Engineering

Model cascading failures: Component fault (A₁) → Subsystem failure (A₂) → System failure (A₃) → Safety shutdown (A₄). Contiguity captures "if this fails, the rest inevitably follow."

Queueing Theory

Customer arrival (A₁) → Wait begins (A₂) → Service starts (A₃) → Departure (A₄). Deterministic routing creates contiguity.

Software Verification

Execution traces: Function entry → Precondition met → Loop invariant held → Postcondition satisfied. Contiguous assertions simplify proofs.

Finance / Risk

Credit event chain: Missed payment → Default → Acceleration → Bankruptcy filing. Regulatory frameworks (Basel) model such sequences.

Related Concepts

• Contiguous probability measures (Le Cam): Sequences of measures mutually absolutely continuous—different from event contiguity.
• Filtrations in stochastic processes: Increasing σ-algebras; events adapted to filtration may form contiguous sequences.
• Monotone events in percolation theory: Increasing/decreasing events under partial order.

Contiguous events model inevitable progression—a powerful abstraction for domino-like systems in engineering, finance, and computing.