# Voter Models On Graphs

dc.contributor.advisor | Durrett, Rick T | |

dc.contributor.author | Huo, Ran | |

dc.date.accessioned | 2019-06-07T19:49:18Z | |

dc.date.available | 2019-06-07T19:49:18Z | |

dc.date.issued | 2019 | |

dc.identifier.uri | https://hdl.handle.net/10161/18789 | |

dc.description | Dissertation | |

dc.description.abstract | <p>The voter model which describes the flow of information through interactions between neighbors has been widely studied in the field of probability. In this paper we study two variations of the voter model, one is called the Latent Voter Model and the other is called the Zealot Voter Model. Both models are implemented in a space that is a random graph.</p><p>In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed</p><p>their choice have a latent period, which is exponential with rate $\lambda$,</p><p>during which they will not buy a new device. We study site and edge versions of this model on </p><p>random graphs generated by a configuration model in which the degrees $d(x)$ have $3 \le d(x) \le M$. We show that if the number of</p><p>vertices $n \to\infty$ and $\log n \ll \lambda_n \ll n$ then the fraction of 1's at time $\lambda_n t$ converges to</p><p>the solution of $du/dt = c_pu(1-u)(1-2u)$. Using this we show</p><p>the latent voter model has a quasi-stationary state in which each opinion has probability $\approx 1/2$ and persists in this state for a time that is $\ge n^m$ for any $m<\infty$. </p><p>Thus, even a very small latent period drastically changes the behavior of the voter model, which has a one parameter family of stationary distributions and reaches fixation in time $O(n)$.</p><p>Inspired by the spread of discontent as in the 2016 presidential election, we consider a voter model</p><p>in which 0's are ordinary voters and 1's are zealots. Thinking of a social network, but desiring the simplicity </p><p>of an infinite object that can have a nontrivial stationary distribution, </p><p>space is represented by a tree. The dynamics are a variant of the biased voter: if $x$ has degree $d(x)$ then</p><p>at rate $d(x)p_k$ the individual at $x$ consults $k\ge 1$ neighbors.</p><p>If at least one neighbor is 1, they adopt state 1, otherwise they become 0. In addition at rate $p_0$</p><p>individuals with opinion 1 change to 0. As in the contact process on trees, we are interested in determining when the zealots</p><p>survive and when they will survive locally, i.e., the root of the tree is in state 1 infinitely often.</p> | |

dc.subject | Mathematics | |

dc.subject | branching random walk | |

dc.subject | coalescing random walk | |

dc.subject | configuration model | |

dc.subject | global survival and local survival | |

dc.subject | the voter model | |

dc.subject | voter model perturbation | |

dc.title | Voter Models On Graphs | |

dc.type | Dissertation | |

dc.department | Mathematics |

### Files in this item

### This item appears in the following Collection(s)

- Duke Dissertations

Dissertations by Duke students