Think of an airline running many itineraries. Each starts at a random airport (law \(\mu\)), hops along random routes (transition probabilities \(P\)), and ends by a rule that cannot peek ahead (a stopping time \(\tau\)). The final airport has law \(\nu\). Fix an airport \(y\) and count every stop there. Each stop is either the …
Continue reading “Count the Flights: Poisson-type Occupancy Equation”