Giovanni Conforti (Potsdam/Padova)
In this talk, we introduce the Schrödinger problem, which is the problem of finding a way to transform an initial distribution into a final one along a stochastic process minimizing the relative entropy with respect to a given refer-ence process. This problem leads naturally to the study of reciprocal walks. For a random walk on a graph, we com-pute explicitly reciprocal characteristics and give their probabilistic interpretation.
