Random walks and combinatorial dimensions in o-minimal groups

Abstract: I will discuss some ideas that go into showing that $n$-independent-step random walks in o-minimally definable group over the real numbers (like a semi-algebraic group) has at most an $n^{-C}$ probability of finishing on a lower-dimensional target set unless the target set contains an ``exponential arc'', where $C$ only depends on the dimension of the target set.

logicprobability

Audience: researchers in the topic

Online logic seminar

Series comments: Description: Seminar on all areas of logic