边缘信息不完整的网络上的熵正则化最优传输
Entropy-regularized optimal transport over networks with incomplete marginals information
AI总结:
针对强连通有向图上的最优质量传输问题,在初始与最终货物分布信息不完整的两种情形下,刻画了最可能流量并确定了全状态空间最可能的边缘分布。
摘要:
本文研究给定离散时间区间上强连通有向图的最优质量传输问题。与现有文献不同,我们不假设已知网络节点上完整的初始和最终货物分布。尽管信息有限,我们证明在两种重要情形下仍可刻画最可能的流量:第一种是仅在节点的真子集上已知初始和/或最终分布的情况;第二种是仅已知边缘分布的某些矩的情况。作为一项重要的附带成果,我们确定了整个状态空间上最可能的初始和最终边缘分布。
英文摘要:
We study in this paper optimal mass transport over a strongly connected, directed graph on a given discrete time interval. Differently from previous literature, we do not assume full knowledge of the initial and final goods distribution over the network nodes. In spite of the meager information, we show that it is possible to characterize the most likely flow in two important cases: The first one is when the initial and/or final distribution is only known on proper subsets of the nodes. The second case is when only some moments of the marginal distributions are known. As an important by-product, we determine the most likely initial and final marginals on the whole state space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。