In this chapter I am writing about my preparations for the upcoming Summer Research Internship at Shanghai Jiao Tong University.
This Chapter looks at the Brownian Bridge, and Context-Aware Transport.
I do not know what Brownian Motion is, so lets do that first
A standard Brownian motion is a random process \(\boldsymbol{X} = \{X_t : t \in [0, \infty)\}\) with state space \(\mathbb{R}\) that satisfies the following properties:
To understand better these rules, we can look at them more closely:
Brownian motion is characterized by the Wiener process
When thinking about spatial homogeneity/time homogeneity, it reminds one of the Markov Process. In a time-homogeneous Markov chain, the probability of transitioning from state \(i\) to state \(j\) depends only on the number of steps (time elapsed), not on the absolute time.
Consider a Brownian motion starting from \(W(0) = 0\) and ending at \(W(u) = x\). Conditioned on fixed \(W(0)\) and \(W(u)\), what is the distribution of \(W(t)\)? By definition, for \(t < u\), conditioned on \(W(u) = x\), \(W(t)\) is a Gaussian. So it is sufficient to compute its mean and variance. As Figure 2 shows, a natural conjecture is that for \(0 \leq t \leq u\), \(\mathbf{E}[W(t) \mid W(u)] = \frac{t}{u}W(u)\).
To verify this, we first prove the following proposition.
Proposition 4 For any \(0 \leq t \leq u\), \(W(t) - \frac{t}{u}W(u)\) is independent of \(W(u)\).
Proof.
The proposition follows from the fact that the two Gaussians are independent iff their covariance is zero. \(\square\)
I am not familiar (mathematically) with Optimal Transport, so let's study that first.
Optimal transport compares distributions by asking how one distribution must physically move to become the other. It is fundamentally Lagrangian because it tracks displacement of mass. It tracks trajectories. Not still points in space. The optimal transport problem is how to transport \( \mu \) to \( \nu \) whilst minimizing the cost \(c\)
Definition 1.1. One says that \( T : X \to Y \) transports \( \mu \in \mathcal{P}(X) \) to \( \nu \in \mathcal{P}(Y) \), and one calls \( T \) a transport map, if
$$ \nu(B) = \mu\left(T^{-1}(B)\right) \qquad \text{for all } \nu\text{-measurable sets } B. $$at the Cambridge Lecture on Optimal Transport, there seem to be 2 ways to formulate this: