This mathematician's namesake criterion speciÂes the conditions under which a Markov chain is time-reversible. Independentlyof a British counterpart, this mathematician demonstrated that the n-step transition probabilities for a Markovprocess can be calculated from the 1-step transition probabilities. This mathematician is the alphabetically-Ârst namesake ofa method reÂned by the Anderson-Darling and Cramer-Von Mises methods, which uses the discrepancy between cumulativefrequencies, called the "D-statistic," to determine whether two distributions are the same. Together with Yakov Sinai, thismathematician developed the concept of metric entropy, and he names the af
This mathematician's namesake criterion speciÂes the conditions under which a Markov chain is time-reversible. Independentlyof a British counterpart, this mathematician demonstrated that the n-step transition probabilities for a Markovprocess can be calculated from the 1-step transition probabilities. This mathematician is the alphabetically-Ârst namesake ofa method reÂned by the Anderson-Darling and Cramer-Von Mises methods, which uses the discrepancy between cumulativefrequencies, called the "D-statistic," to determine whether two distributions are the same. Together with Yakov Sinai, thismathematician developed the concept of metric entropy, and he names the aforementioned formula for transition probabilitieswith Sidney Chapman. The axioms of unitarity and sigma-additivity are two of a set of probability axioms named forthis man, who developed the idea of complexity as minimal description length and proposed a theorem that shows whichquasiperiodic orbits survive under a small perturbation of a dynamical system. For 10 points, identify this Russian mathematician,the namesake of a statistical test with Smirnov and a theorem of dynamics with Arnold and Moser
This mathematician's namesake criterion speciÂes the conditions under which a Markov chain is time-reversible.
Andrei Nikolayevich Kolmogorov