无限规则树上概率量之间的传输距离

IF 0.9 3区 数学 Q2 MATHEMATICS SIAM Journal on Discrete Mathematics Pub Date : 2024-03-15 DOI:10.1137/21m1448781
Pakawut Jiradilok, Supanat Kamtue
{"title":"无限规则树上概率量之间的传输距离","authors":"Pakawut Jiradilok, Supanat Kamtue","doi":"10.1137/21m1448781","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 1113-1157, March 2024. <br/> Abstract. In the infinite regular tree [math] with [math], we consider families [math], indexed by vertices [math] and nonnegative integers (“discrete time steps”) [math], of probability measures such that [math] if the distances [math] and [math] are equal. Let [math] be a positive integer, and let [math] and [math] be two vertices in the tree which are at distance [math] apart. We compute a formula for the transportation distance [math] in terms of generating functions. In the special case where [math] are measures from simple random walks after [math] time steps, we establish the linear asymptotic formula [math], as [math], and give the formulas for the coefficients [math] and [math] in closed forms. We also obtain linear asymptotic formulas when [math] is the uniform distribution on the sphere or on the ball of radius [math] as [math]. We show that these six coefficients (two from the simple random walk, two from the uniform distribution on the sphere, and two from the uniform distribution on the ball) are related by inequalities.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transportation Distance between Probability Measures on the Infinite Regular Tree\",\"authors\":\"Pakawut Jiradilok, Supanat Kamtue\",\"doi\":\"10.1137/21m1448781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 1113-1157, March 2024. <br/> Abstract. In the infinite regular tree [math] with [math], we consider families [math], indexed by vertices [math] and nonnegative integers (“discrete time steps”) [math], of probability measures such that [math] if the distances [math] and [math] are equal. Let [math] be a positive integer, and let [math] and [math] be two vertices in the tree which are at distance [math] apart. We compute a formula for the transportation distance [math] in terms of generating functions. In the special case where [math] are measures from simple random walks after [math] time steps, we establish the linear asymptotic formula [math], as [math], and give the formulas for the coefficients [math] and [math] in closed forms. We also obtain linear asymptotic formulas when [math] is the uniform distribution on the sphere or on the ball of radius [math] as [math]. We show that these six coefficients (two from the simple random walk, two from the uniform distribution on the sphere, and two from the uniform distribution on the ball) are related by inequalities.\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/21m1448781\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/21m1448781","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

SIAM 离散数学杂志》,第 38 卷,第 1 期,第 1113-1157 页,2024 年 3 月。 摘要。在有[math]的无限正则树[math]中,我们考虑以顶点[math]和非负整数("离散时间步长")[math]为索引的概率度量族[math],如果[math]和[math]的距离相等,则[math]。设[math]为正整数,[math]和[math]是树中相距[math]的两个顶点。我们用生成函数计算出运输距离 [math] 的公式。在[math]是简单随机游走经过[math]个时间步后的度量的特殊情况下,我们建立了线性渐近公式[math],如[math],并给出了系数[math]和[math]的封闭式公式。当[math]是球面上或半径为[math]的球上的均匀分布时,我们也能得到线性渐近公式[math]。我们证明这六个系数(两个来自简单随机行走,两个来自球上均匀分布,两个来自球上均匀分布)是通过不等式联系起来的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Transportation Distance between Probability Measures on the Infinite Regular Tree
SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 1113-1157, March 2024.
Abstract. In the infinite regular tree [math] with [math], we consider families [math], indexed by vertices [math] and nonnegative integers (“discrete time steps”) [math], of probability measures such that [math] if the distances [math] and [math] are equal. Let [math] be a positive integer, and let [math] and [math] be two vertices in the tree which are at distance [math] apart. We compute a formula for the transportation distance [math] in terms of generating functions. In the special case where [math] are measures from simple random walks after [math] time steps, we establish the linear asymptotic formula [math], as [math], and give the formulas for the coefficients [math] and [math] in closed forms. We also obtain linear asymptotic formulas when [math] is the uniform distribution on the sphere or on the ball of radius [math] as [math]. We show that these six coefficients (two from the simple random walk, two from the uniform distribution on the sphere, and two from the uniform distribution on the ball) are related by inequalities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.90
自引率
0.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.
期刊最新文献
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs A Stability Result of the Pósa Lemma A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs Tuza’s Conjecture for Binary Geometries
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1