伪树上的图索引随机漫步

Q2 Mathematics
Jan Bok , Jaroslav Nešetřil
{"title":"伪树上的图索引随机漫步","authors":"Jan Bok ,&nbsp;Jaroslav Nešetřil","doi":"10.1016/j.endm.2018.06.045","DOIUrl":null,"url":null,"abstract":"<div><p>We investigate the average range of 1-Lipschitz mappings (graph-indexed random walks) of a given connected graph. This parameter originated in statistical physics, it is connected to the study of random graph homomorphisms and generalizes standard random walks on <span><math><mi>Z</mi></math></span>.</p><p>Our first goal is to prove a closed-form formula for this parameter for cycle graphs. The second one is to prove two conjectures, the first by Benjamini, Häggström and Mossel and the second by Loebl, Nešetřil and Reed, for unicyclic graphs. This extends a result of Wu, Xu, and Zhu [5] who proved the aforementioned conjectures for trees.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.045","citationCount":"2","resultStr":"{\"title\":\"Graph-indexed random walks on pseudotrees\",\"authors\":\"Jan Bok ,&nbsp;Jaroslav Nešetřil\",\"doi\":\"10.1016/j.endm.2018.06.045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We investigate the average range of 1-Lipschitz mappings (graph-indexed random walks) of a given connected graph. This parameter originated in statistical physics, it is connected to the study of random graph homomorphisms and generalizes standard random walks on <span><math><mi>Z</mi></math></span>.</p><p>Our first goal is to prove a closed-form formula for this parameter for cycle graphs. The second one is to prove two conjectures, the first by Benjamini, Häggström and Mossel and the second by Loebl, Nešetřil and Reed, for unicyclic graphs. This extends a result of Wu, Xu, and Zhu [5] who proved the aforementioned conjectures for trees.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.045\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2

摘要

我们研究了给定连通图的1-Lipschitz映射(图索引随机游走)的平均范围。这个参数起源于统计物理,它与随机图同态的研究有关,并推广了z上的标准随机行走。我们的第一个目标是证明循环图上这个参数的一个封闭形式公式。第二个是证明关于单环图的两个猜想,第一个是Benjamini, Häggström和Mossel的猜想,第二个是Loebl, Nešetřil和Reed的猜想。这扩展了Wu、Xu和Zhu[5]的结果,他们证明了上述关于树木的猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Graph-indexed random walks on pseudotrees

We investigate the average range of 1-Lipschitz mappings (graph-indexed random walks) of a given connected graph. This parameter originated in statistical physics, it is connected to the study of random graph homomorphisms and generalizes standard random walks on Z.

Our first goal is to prove a closed-form formula for this parameter for cycle graphs. The second one is to prove two conjectures, the first by Benjamini, Häggström and Mossel and the second by Loebl, Nešetřil and Reed, for unicyclic graphs. This extends a result of Wu, Xu, and Zhu [5] who proved the aforementioned conjectures for trees.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信