在先前访问的顶点上去除多个聚结粒子的平均吸收时间

IF 0.7 4区数学 Q3 STATISTICS & PROBABILITY

Statistics & Probability Letters Pub Date : 2025-08-13 DOI:10.1016/j.spl.2025.110523

Mario A. Estrada , Alex D. Ramos , Pablo M. Rodriguez

{"title":"在先前访问的顶点上去除多个聚结粒子的平均吸收时间","authors":"Mario A. Estrada , Alex D. Ramos , Pablo M. Rodriguez","doi":"10.1016/j.spl.2025.110523","DOIUrl":null,"url":null,"abstract":"<div><div>We study a stochastic process of multiple coalescing particles. In our process, <span><math><mi>k</mi></math></span> particles begin at an arbitrary but fixed vertex of a complete graph. Each particle performs an independent discrete-time symmetric random walk on the graph. When two or more particles meet at a given vertex, they merge into a single particle that continues the random walk through the graph. If a particle jumps to a vertex that has been previously visited by another particle, it is removed from the system. We analyze the asymptotic behavior of the absorption time of the process; i.e., the number of steps until the last particle is removed from the system.</div></div>","PeriodicalId":49475,"journal":{"name":"Statistics & Probability Letters","volume":"227 ","pages":"Article 110523"},"PeriodicalIF":0.7000,"publicationDate":"2025-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the mean absorption time of multiple coalescing particles with removal at previously visited vertices\",\"authors\":\"Mario A. Estrada , Alex D. Ramos , Pablo M. Rodriguez\",\"doi\":\"10.1016/j.spl.2025.110523\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We study a stochastic process of multiple coalescing particles. In our process, <span><math><mi>k</mi></math></span> particles begin at an arbitrary but fixed vertex of a complete graph. Each particle performs an independent discrete-time symmetric random walk on the graph. When two or more particles meet at a given vertex, they merge into a single particle that continues the random walk through the graph. If a particle jumps to a vertex that has been previously visited by another particle, it is removed from the system. We analyze the asymptotic behavior of the absorption time of the process; i.e., the number of steps until the last particle is removed from the system.</div></div>\",\"PeriodicalId\":49475,\"journal\":{\"name\":\"Statistics & Probability Letters\",\"volume\":\"227 \",\"pages\":\"Article 110523\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Statistics & Probability Letters\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167715225001683\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Statistics & Probability Letters","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167715225001683","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了一个多聚结粒子的随机过程。在我们的过程中，k个粒子从一个完全图的任意但固定的顶点开始。每个粒子在图上执行独立的离散时间对称随机漫步。当两个或多个粒子在给定的顶点相遇时，它们合并成一个粒子，继续在图中随机行走。如果一个粒子跳到另一个粒子之前访问过的顶点，它就会从系统中移除。我们分析了过程的吸收时间的渐近行为；即，直到最后一个粒子从系统中移除的步数。

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

查看原文本刊更多论文

On the mean absorption time of multiple coalescing particles with removal at previously visited vertices

We study a stochastic process of multiple coalescing particles. In our process,

k

particles begin at an arbitrary but fixed vertex of a complete graph. Each particle performs an independent discrete-time symmetric random walk on the graph. When two or more particles meet at a given vertex, they merge into a single particle that continues the random walk through the graph. If a particle jumps to a vertex that has been previously visited by another particle, it is removed from the system. We analyze the asymptotic behavior of the absorption time of the process; i.e., the number of steps until the last particle is removed from the system.

求助全文

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

来源期刊

Statistics & Probability Letters 数学-统计学与概率论

CiteScore

1.60

自引率

0.00%

发文量

173

审稿时长

6 months

期刊介绍： Statistics & Probability Letters adopts a novel and highly innovative approach to the publication of research findings in statistics and probability. It features concise articles, rapid publication and broad coverage of the statistics and probability literature. Statistics & Probability Letters is a refereed journal. Articles will be limited to six journal pages (13 double-space typed pages) including references and figures. Apart from the six-page limitation, originality, quality and clarity will be the criteria for choosing the material to be published in Statistics & Probability Letters. Every attempt will be made to provide the first review of a submitted manuscript within three months of submission. The proliferation of literature and long publication delays have made it difficult for researchers and practitioners to keep up with new developments outside of, or even within, their specialization. The aim of Statistics & Probability Letters is to help to alleviate this problem. Concise communications (letters) allow readers to quickly and easily digest large amounts of material and to stay up-to-date with developments in all areas of statistics and probability. The mainstream of Letters will focus on new statistical methods, theoretical results, and innovative applications of statistics and probability to other scientific disciplines. Key results and central ideas must be presented in a clear and concise manner. These results may be part of a larger study that the author will submit at a later time as a full length paper to SPL or to another journal. Theory and methodology may be published with proofs omitted, or only sketched, but only if sufficient support material is provided so that the findings can be verified. Empirical and computational results that are of significant value will be published.