Transportation Distance between Probability Measures on the Infinite Regular Tree
Pakawut Jiradilok, Supanat Kamtue

TL;DR
This paper derives formulas for transportation distances between probability measures on an infinite regular tree, including asymptotic behaviors for random walks and geometric measures, revealing relationships among key coefficients.
Contribution
It provides explicit formulas for transportation distances on infinite regular trees and establishes asymptotic linear formulas for various probability measures, connecting these results through inequalities.
Findings
Explicit formula for $W_1$ between measures at vertices
Linear asymptotics for random walk measures as time grows
Relationships and inequalities among coefficients for different measures
Abstract
In the infinite regular tree with , we consider families , indexed by vertices and nonnegative integers ("discrete time steps") , of probability measures such that if the distances and are equal. Let be a positive integer, and let and be two vertices in the tree which are at distance apart. We compute a formula for the transportation distance in terms of generating functions. In the special case where are measures from simple random walks after time steps, we establish the linear asymptotic formula , as , and give the formulas for the coefficients and in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Geometry and complex manifolds · Markov Chains and Monte Carlo Methods
