2018
DOI: 10.1016/j.spa.2017.08.004
|View full text |Cite
|
Sign up to set email alerts
|

Latent voter model on locally tree-like random graphs

Abstract: 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 λ, 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 ≤ d(x) ≤ M . We show that if the number of vertices n → ∞ and log n ≪ λ n ≪ n then the latent voter model has a quasi-stationary state in which… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 26 publications
(42 reference statements)
0
8
0
Order By: Relevance
“…This result can be easily proved using the techniques in [12]. The key idea is that when ε is small most of the steps in the dual are random walk steps, and the random walk is transient, so any coalescence occurs soon after branching, and the dual is essentially a coalescing branching random walk.…”
Section: Results For Galton-watson Treesmentioning
confidence: 96%
“…This result can be easily proved using the techniques in [12]. The key idea is that when ε is small most of the steps in the dual are random walk steps, and the random walk is transient, so any coalescence occurs soon after branching, and the dual is essentially a coalescing branching random walk.…”
Section: Results For Galton-watson Treesmentioning
confidence: 96%
“…• In Section 3.6 we put the pieces together to prove the result. As in Section 3.5 of [20] we do this by showing that if the density U n (t) reaches |U n (t) − 1/2| = 4 , then with very high probability (i.e., for any k with probability ≥ 1 − n −k for large n) it will return to |U n (t) − 1/2| ≤ before we have |U n (t) − 1/2| > 5 . Taking δ = 5…”
Section: Ode Limitmentioning
confidence: 99%
“…This has the consequence that if there are n • u 1's at time t/ n − n b , then at time t/ n the process is close to the voter equilibrium ν u . The argument here is an improvement over the one in Section 3.1 of [20]. We use Azuma's inequality to get error estimates that are stretched exponentially small, i.e., ≤ C exp(cn −α ) with α > 0 rather than polynomial, i.e., ≤ Ct −p .…”
Section: Ode Limitmentioning
confidence: 99%
See 1 more Smart Citation
“…To prove Theorem 3, we will follow the approach of Huo and Durrett [20] who proved a similar result for the latent voter model on a random graph generated by the configuration model. Although the random graph has a more complicated geometry than the torus, the proof in that setting is simpler than the one given here, since on the graph random walks mix in time O(log n) rather that in time O(n 2/3 ).…”
Section: Ode Limitmentioning
confidence: 99%

The q-voter model on the torus

Agarwal,
Simper,
Durrett
2020
Preprint
Self Cite