arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.6802math.PR
收藏

随机环境中N树和Galton-Watson树上的谣言过程

Rumor processes in random environment on N and on Galton-Watson trees

Daniela Bertacchi, Fabio Zucca

摘要:

本文主要研究随机环境下的谣言过程。在谣言过程中,信号从固定顶点(根)的站开始,并在图上从顶点传播到顶点。我们考虑两个谣言过程。在烟花过程中,当信号到达每个站时,将其传输到随机距离。另一方面,在反向烟花过程中,电台不发送任何信号,但它们会在随机距离内“收听”信号。我们考虑的第一个随机环境是确定性的一维树N,每个顶点上有随机数的站点;在这种情况下,根是N的原点。我们给生存/灭绝的条件,几乎每一个实现的序列的站。随后,我们研究了每个顶点上有随机数个站点的Galton-Watson树上的过程。我们表明,如果生存的概率是积极的,那么几乎每个实现的无限树,使至少有一个站在根上的生存。我们在某些情况下的生存过程的特点,我们给生存/灭绝的充分条件。

英文摘要:

The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to vertex. We consider two rumor processes. In the firework process each station, when reached by the signal, transmits it up to a random distance. In the reverse firework process, on the other hand, stations do not send any signal but they "listen" for it up to a random distance. The first random environment that we consider is the deterministic 1-dimensional tree N with a random number of stations on each vertex; in this case the root is the origin of N. We give conditions for the survival/extinction on almost every realization of the sequence of stations. Later on, we study the processes on Galton-Watson trees with random number of stations on each vertex. We show that if the probability of survival is positive, then there is survival on almost every realization of the infinite tree such that there is at least one station at the root. We characterize the survival of the process in some cases and we give sufficient conditions for survival/extinction.

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

↑