The more you study 20th-century Probability Theory, the more you see how the Russian School trained a certain kind of engineering mind.
When you hear about modern high-end systems coming out of that ecosystem, including nuclear energy, space and hypersonic missile programs, it doesn’t feel like it came from nowhere.
Giants of the Russian School of Probability Theory Turned Noise into Structure.
In 1906, Andrey A. Markov asked what sounded like a heretical question at the time. If randomness is allowed to remember something, even just the present, does probability theory fall apart?
His answer was surprisingly calm. You let the next step depend only on where you are now,
P(Xₙ₊₁ = j | Xₙ = i, Xₙ₋₁, …) = Pᵢⱼ,
and nothing collapses. Individual paths stay noisy, but long-run averages still behave. State frequencies settle down to a fixed profile π with
π = πP.
The bead jitters forever, but the glow it leaves behind stabilizes.
That idea turned out to be everywhere. Random-walk estimates. MCMC, where you build a chain whose stationary distribution is the thing you want and then trust time averages. Hidden Markov models in time series. Ion channels flicking open and shut. Control and reinforcement learning, where the world resets its memory at every step. One simple constraint, enormous reach.
Then, in 1931, Andrey Nikolaevich Kolmogorov took Markov’s step-by-step idea and tilted it sideways. Instead of only asking where the chain spends its time in the long run, he asked how the entire distribution moves right now.
In continuous time, the same Markov mechanism becomes dynamics:
dp/dt = pQ,
with Q the generator. Probability stops being a static histogram and turns into something that flows. In the render, that’s the fog spreading through the maze. The flux layer is the net current pushed through corridors and the portal. The particles are just sample paths of the same generator. One process, three ways of seeing it.
The final shift is more subtle. If the forward equation tells you how probability moves, there’s another question it doesn’t answer on its own. From a given state, what does the future look like?
Pick two terminal sets, A and B, and define
q(x) = Pₓ[hit B before A].
That q isn’t a density. It’s a forecast attached to each state. Kolmogorov’s backward view says this forecast is harmonic in the interior. With boundary conditions q = 0 on A and q = 1 on B, it satisfies
Lq = 0.
Now the background field in the render isn’t where probability is. It’s how likely success is. Dark regions mean you’re probably doomed to hit A first. Bright regions mean B is likely. The sharp transition near the portal is where the decision really gets made.
Over that chance map, the forward fog starts moving. Probability mass bunches in narrow corridors, spills around corners, and streams through the portal. The glowing filaments show the dominant routes toward B. The particles just trace those same routes as individual random paths.
All three views come from the same Markov generator. Long-run averages. Time-evolving distributions. State-by-state forecasts. Same mechanism, different lenses.
#ProbabilityTheory #MarkovChains #Kolmogorov #StochasticProcesses #MCMC #RandomWalks #BackwardEquation #ForwardEquation #AppliedProbability #Mathematics #Russian #Russians