Consider a Galton Watson tree of height $ m $: each leaf has one of $ k $ opinions or not. In other words, for $ i\in \{1,\dots,k\} $, $ x $ at generation $ m $ thinks $ i $ with probability $ {\bf{p}}_i $ and nothing with probability $ {\bf{p}}_0 $. Moreover the opinions are independently distributed for each leaf.
Opinions spread along the tree based on a specific rule: the majority wins! In this paper, we study the asymptotic behavior of the distribution of the opinion of the root when $ m\to\infty $.
Citation: |
[1] |
I. Benjamini and Y. Lima, Annihilation and coalescence on binary trees, Stoch. Dyn., 14 (2014), 1350023, 11 pp.
doi: 10.1142/S0219493713500238.![]() ![]() ![]() |
[2] |
N. B. Conkwright, An elementary proof of the Budan-Fourier theorem, Amer. Math. Monthly, 50 (1943), 603-605.
doi: 10.2307/2303801.![]() ![]() ![]() |
[3] |
P. Debs and T. Haberkorn, Diseases transmission in a $z$-ary tree, Stoch. Dyn., 17 (2017), 1750038, 29 pp.
doi: 10.1142/S0219493717500381.![]() ![]() ![]() |
[4] |
H. W. Gould, Combinatorial identities: Table Ⅰ: Intermediate techniques for summing finite series, From the seven unpublished manuscripts of H. W. Gould, Edited and Compiled by Jocelyn Quaintance, Vol. 4, 2010.
![]() |
The rules
An example
The graphs of
The graphs of
The graphs of
The graph of
The graphs of
The graphs of