Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry
Abstract
We study the probability simplex of a finite connected weighted graph with an Onsager operator combining logarithmic-mean transport and mass-conserving Fisher reaction. For every fixed positive reaction parameter, we prove that the entropy Hessian has a finite global lower bound if and only if the original transport graph has diameter at most two. Near a boundary probability, the corresponding criterion is that its positive support reaches every vertex in at most two steps. The proof controls all potential directions under arbitrary multiscale boundary degeneration. For graphs of diameter at most two, the optimal lower bound is Lipschitz on bounded parameter intervals, including the pure-transport endpoint. We also determine the largest instantaneous logarithmic-amplitude dissipation function depending only on the graph and the current amplitude, and construct two-level probabilities attaining it. Its positivity has the same two-step criterion. As consequences, we obtain graph-dependent entropy-decay estimates and exact projective contraction bounds without assuming nonnegative entropic curvature.
Related
- Sharp diameter estimates via integral geometry
- Discrete Gromov-Wasserstein Duality: Algorithms and Isomorphism Testing
- Criteria for discrete decomposability and admissibility in the branching problem
- Semi-discrete quadratic Wasserstein energy and state-dependent Langevin exploration
- Exact Asymptotic Efficiency under zCDP: Diameter-Constrained Information Geometry
BibTeX
@misc{zhang2026graphdiameter,
title = {{Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry}},
author = {Rubin Zhang and Ning Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.38129},
eprint = {2610.38129},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.38129},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry
AU - Rubin Zhang
AU - Ning Zhang
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2610.38129
UR - https://arxiv.org/abs/2610.38129
AB - We study the probability simplex of a finite connected weighted graph with an Onsager operator combining logarithmic-mean transport and mass-conserving Fisher reaction. For every fixed positive reaction parameter, we prove that the entropy Hessian has a finite global lower bound if and only if the original transport graph has diameter at most two. Near a boundary probability, the corresponding criterion is that its positive support reaches every vertex in at most two steps. The proof controls all potential directions under arbitrary multiscale boundary degeneration. For graphs of diameter at most two, the optimal lower bound is Lipschitz on bounded parameter intervals, including the pure-transport endpoint. We also determine the largest instantaneous logarithmic-amplitude dissipation function depending only on the graph and the current amplitude, and construct two-level probabilities attaining it. Its positivity has the same two-step criterion. As consequences, we obtain graph-dependent entropy-decay estimates and exact projective contraction bounds without assuming nonnegative entropic curvature.
ER -