Transportation Distance between Probability Measures on the Infinite Regular Tree
DOI10.1137/21m1448781arXiv2107.09876OpenAlexW4392863217MaRDI QIDQ6130541
Supanat Kamtue, Pakawut Jiradilok
Publication date: 3 April 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09876
generating functionsasymptotic formulasWasserstein distancerandom walks on graphsoptimal transportOllivier-Ricci curvatureinfinite regular treetransportation distancecoarse Ricci curvatureKantorovich problemgraph statisticsradially symmetric probability distributions
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Distance in graphs (05C12) Asymptotic enumeration (05A16) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Infinite graphs (05C63) Random walks on graphs (05C81) Flows in graphs (05C21) Optimal transportation (49Q22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact and asymptotic results on coarse Ricci curvature of graphs
- Non-commutative rational power series and algebraic generating functions
- Ricci curvature of graphs
- Mixing and concentration by Ricci curvature
- Ricci curvature of Markov chains on metric spaces
- The On-Line Encyclopedia of Integer Sequences
- Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs
- Long-scale ollivier Ricci curvature of graphs
- Ollivier Ricci curvature for general graph Laplacians: heat equation, Laplacian comparison, non-explosion and diameter bounds
- On mass transportation
- Ollivier--Ricci Idleness Functions of Graphs
- Random Walks on Infinite Graphs and Groups
- A Continuous Model of Transportation
This page was built for publication: Transportation Distance between Probability Measures on the Infinite Regular Tree
