无限晶格上静止弹道沉积的存在性

IF 0.9 3区 数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Random Structures & Algorithms Pub Date : 2021-10-19 DOI:10.1002/rsa.21116
S. Chatterjee
{"title":"无限晶格上静止弹道沉积的存在性","authors":"S. Chatterjee","doi":"10.1002/rsa.21116","DOIUrl":null,"url":null,"abstract":"Ballistic deposition is one of the many models of interface growth that are believed to be in the KPZ universality class, but have so far proved to be largely intractable mathematically. In this model, blocks of size one fall independently as Poisson processes at each site on the d$$ d $$ ‐dimensional lattice, and either attach themselves to the column growing at that site, or to the side of an adjacent column, whichever comes first. It is not hard to see that if we subtract off the height of the column at the origin from the heights of the other columns, the resulting interface process is Markovian. The main result of this article is that this Markov process has at least one invariant probability measure. We conjecture that the invariant measure is not unique, and provide some partial evidence.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"54 1","pages":"600 - 622"},"PeriodicalIF":0.9000,"publicationDate":"2021-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Existence of stationary ballistic deposition on the infinite lattice\",\"authors\":\"S. Chatterjee\",\"doi\":\"10.1002/rsa.21116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ballistic deposition is one of the many models of interface growth that are believed to be in the KPZ universality class, but have so far proved to be largely intractable mathematically. In this model, blocks of size one fall independently as Poisson processes at each site on the d$$ d $$ ‐dimensional lattice, and either attach themselves to the column growing at that site, or to the side of an adjacent column, whichever comes first. It is not hard to see that if we subtract off the height of the column at the origin from the heights of the other columns, the resulting interface process is Markovian. The main result of this article is that this Markov process has at least one invariant probability measure. We conjecture that the invariant measure is not unique, and provide some partial evidence.\",\"PeriodicalId\":54523,\"journal\":{\"name\":\"Random Structures & Algorithms\",\"volume\":\"54 1\",\"pages\":\"600 - 622\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Structures & Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21116\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/rsa.21116","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

弹道沉积是许多界面生长模型之一,被认为是在KPZ通用性类中,但迄今为止已被证明在数学上很大程度上难以解决。在这个模型中,大小为1的块在d $$ d $$维晶格上的每个位置上作为泊松过程独立落下,并且将自己附着在该位置生长的列上,或者附着在相邻列的一侧,以先到者为准。不难看出,如果我们从其他列的高度中减去原点处列的高度,则得到的界面过程是马尔可夫的。本文的主要结论是该马尔可夫过程至少有一个不变的概率测度。我们推测不变测度不是唯一的,并提供了部分证据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Existence of stationary ballistic deposition on the infinite lattice
Ballistic deposition is one of the many models of interface growth that are believed to be in the KPZ universality class, but have so far proved to be largely intractable mathematically. In this model, blocks of size one fall independently as Poisson processes at each site on the d$$ d $$ ‐dimensional lattice, and either attach themselves to the column growing at that site, or to the side of an adjacent column, whichever comes first. It is not hard to see that if we subtract off the height of the column at the origin from the heights of the other columns, the resulting interface process is Markovian. The main result of this article is that this Markov process has at least one invariant probability measure. We conjecture that the invariant measure is not unique, and provide some partial evidence.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Random Structures & Algorithms
Random Structures & Algorithms 数学-计算机:软件工程
CiteScore
2.50
自引率
10.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness. Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.
期刊最新文献
Sharp thresholds in adaptive random graph processes The number of descendants in a random directed acyclic graph Counting orientations of random graphs with no directed k‐cycles Prominent examples of flip processes Defective coloring of hypergraphs
×
引用
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