Skip to main content
Duke University Libraries
DukeSpace Scholarship by Duke Authors
  • Login
  • Ask
  • Menu
  • Login
  • Ask a Librarian
  • Search & Find
  • Using the Library
  • Research Support
  • Course Support
  • Libraries
  • About
View Item 
  •   DukeSpace
  • Theses and Dissertations
  • Duke Dissertations
  • View Item
  •   DukeSpace
  • Theses and Dissertations
  • Duke Dissertations
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Voter Models On Graphs

Thumbnail
View / Download
591.8 Kb
Date
2019
Author
Huo, Ran
Advisor
Durrett, Rick T
Repository Usage Stats
291
views
427
downloads
Abstract

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.

In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed

their choice have a latent period, which is exponential with rate $\lambda$,

during which they will not buy a new device. We study site and edge versions of this model on

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

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

the solution of $du/dt = c_pu(1-u)(1-2u)$. Using this we show

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$.

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)$.

Inspired by the spread of discontent as in the 2016 presidential election, we consider a voter model

in which 0's are ordinary voters and 1's are zealots. Thinking of a social network, but desiring the simplicity

of an infinite object that can have a nontrivial stationary distribution,

space is represented by a tree. The dynamics are a variant of the biased voter: if $x$ has degree $d(x)$ then

at rate $d(x)p_k$ the individual at $x$ consults $k\ge 1$ neighbors.

If at least one neighbor is 1, they adopt state 1, otherwise they become 0. In addition at rate $p_0$

individuals with opinion 1 change to 0. As in the contact process on trees, we are interested in determining when the zealots

survive and when they will survive locally, i.e., the root of the tree is in state 1 infinitely often.

Description
Dissertation
Type
Dissertation
Department
Mathematics
Subject
Mathematics
branching random walk
coalescing random walk
configuration model
global survival and local survival
the voter model
voter model perturbation
Permalink
https://hdl.handle.net/10161/18789
Citation
Huo, Ran (2019). Voter Models On Graphs. Dissertation, Duke University. Retrieved from https://hdl.handle.net/10161/18789.
Collections
  • Duke Dissertations
More Info
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 United States License.

Rights for Collection: Duke Dissertations


Works are deposited here by their authors, and represent their research and opinions, not that of Duke University. Some materials and descriptions may include offensive content. More info

Make Your Work Available Here

How to Deposit

Browse

All of DukeSpaceCommunities & CollectionsAuthorsTitlesTypesBy Issue DateDepartmentsAffiliations of Duke Author(s)SubjectsBy Submit DateThis CollectionAuthorsTitlesTypesBy Issue DateDepartmentsAffiliations of Duke Author(s)SubjectsBy Submit Date

My Account

LoginRegister

Statistics

View Usage Statistics
Duke University Libraries

Contact Us

411 Chapel Drive
Durham, NC 27708
(919) 660-5870
Perkins Library Service Desk

Digital Repositories at Duke

  • Report a problem with the repositories
  • About digital repositories at Duke
  • Accessibility Policy
  • Deaccession and DMCA Takedown Policy

TwitterFacebookYouTubeFlickrInstagramBlogs

Sign Up for Our Newsletter
  • Re-use & Attribution / Privacy
  • Harmful Language Statement
  • Support the Libraries
Duke University