arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.04017math.PRcond-mat.stat-mechmath-phmath.MGmath.MP
收藏

Sierpinski垫片图的内部DLA

Internal DLA on Sierpinski gasket graphs

Joe P. Chen, Wilfried Huss, Ecaterina Sava-Huss, Alexander Teplyaev

摘要:

内部扩散限制聚集(IDLA)是图$G$上的一个随机增长模型,它描述了从$G$的原点(某个固定顶点)开始随机增长的顶点集的形成。粒子从原点开始,执行简单的随机游动;每个粒子移动,直到它降落在其他粒子以前没有访问过的站点上。$G$中被占用的位点的随机集合称为IDLA簇。在本文中,我们认为IDLA Sierpinski垫片图,并表明,IDLA集群填充球(在图度量)的概率为1。

英文摘要:

Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph $G$ which describes the formation of a random set of vertices growing from the origin (some fixed vertex) of $G$. Particles start at the origin and perform simple random walks; each particle moves until it lands on a site which was not previously visited by other particles. This random set of occupied sites in $G$ is called the IDLA cluster. In this paper we consider IDLA on Sierpinski gasket graphs, and show that the IDLA cluster fills balls (in the graph metric) with probability 1.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑