Metraipolis › archive › dc_1cae26ecdfe4
Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry — arXiv:2610.38129
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38129
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:34:07.503Z
- SHA-256 of the archived text
32254b5760f482d411bab3a898fa579de2976fd525856847c846f4e949930dc6- Stable URL of this page
https://metraipolis.com/documento/dc_1cae26ecdfe4
How to cite
Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry — arXiv:2610.38129 — arXiv (en), https://arxiv.org/abs/2610.38129 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1cae26ecdfe4 (Metraipolis archive dc_1cae26ecdfe4, sha256 32254b5760f482d411bab3a898fa579de2976fd525856847c846f4e949930dc6)
BibTeX
@misc{dc1cae26ecdfe4,
title = {Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry — arXiv:2610.38129},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38129},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1cae26ecdfe4; sha256 32254b5760f482d411bab3a898fa579de2976fd525856847c846f4e949930dc6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38129. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Probability (math.PR) ; Differential Geometry (math.DG). Pagina del lavoro: https://arxiv.org/abs/2610.38129 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:14:58.615Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).