蚯蚓的足迹大小

IF 0.5 4区数学 Q4 STATISTICS & PROBABILITY

Electronic Communications in Probability Pub Date : 2023-01-01 DOI:10.1214/23-ecp556

Krzysztof Burdzy, Shi Feng, Daisuke Shiraishi

{"title":"蚯蚓的足迹大小","authors":"Krzysztof Burdzy, Shi Feng, Daisuke Shiraishi","doi":"10.1214/23-ecp556","DOIUrl":null,"url":null,"abstract":"We investigate the number of holes created by an “earthworm” moving on the two-dimensional integer lattice. The earthworm is modeled by a simple random walk. At the initial time, all vertices are filled with grains of soil except for the position of the earthworm. At each step, the earthworm pushes the soil in the direction of its motion. It leaves a hole (an empty vertex with no grain of soil) behind it. If there are holes in front of the earthworm (in the direction of its step), the closest hole is filled with a grain of soil. Thus the number of holes increases by 1 or remains unchanged at every step. We show that the number of holes is at least O(n3∕4)after n steps.","PeriodicalId":50543,"journal":{"name":"Electronic Communications in Probability","volume":"49 1","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the size of earthworm’s trail\",\"authors\":\"Krzysztof Burdzy, Shi Feng, Daisuke Shiraishi\",\"doi\":\"10.1214/23-ecp556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the number of holes created by an “earthworm” moving on the two-dimensional integer lattice. The earthworm is modeled by a simple random walk. At the initial time, all vertices are filled with grains of soil except for the position of the earthworm. At each step, the earthworm pushes the soil in the direction of its motion. It leaves a hole (an empty vertex with no grain of soil) behind it. If there are holes in front of the earthworm (in the direction of its step), the closest hole is filled with a grain of soil. Thus the number of holes increases by 1 or remains unchanged at every step. We show that the number of holes is at least O(n3∕4)after n steps.\",\"PeriodicalId\":50543,\"journal\":{\"name\":\"Electronic Communications in Probability\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Communications in Probability\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1214/23-ecp556\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Communications in Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1214/23-ecp556","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了在二维整数晶格上移动的“蚯蚓”所产生的孔的数量。蚯蚓是通过一个简单的随机漫步来建模的。在初始时刻，除了蚯蚓的位置，所有的顶点都被土粒填充。每走一步，蚯蚓就把土壤推向它运动的方向。它在后面留下一个洞(一个没有土壤颗粒的空顶点)。如果蚯蚓的前面有洞(在它的台阶方向上)，最近的洞里就会填满一粒土。因此，孔的数量每一步增加1或保持不变。我们证明了在n步之后，洞的数量至少为O(n3∕4)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the size of earthworm’s trail

We investigate the number of holes created by an “earthworm” moving on the two-dimensional integer lattice. The earthworm is modeled by a simple random walk. At the initial time, all vertices are filled with grains of soil except for the position of the earthworm. At each step, the earthworm pushes the soil in the direction of its motion. It leaves a hole (an empty vertex with no grain of soil) behind it. If there are holes in front of the earthworm (in the direction of its step), the closest hole is filled with a grain of soil. Thus the number of holes increases by 1 or remains unchanged at every step. We show that the number of holes is at least O(n3∕4)after n steps.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Communications in Probability 工程技术-统计学与概率论

CiteScore

1.00

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The Electronic Communications in Probability (ECP) publishes short research articles in probability theory. Its sister journal, the Electronic Journal of Probability (EJP), publishes full-length articles in probability theory. Short papers, those less than 12 pages, should be submitted to ECP first. EJP and ECP share the same editorial board, but with different Editors in Chief.