CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Cutoff for the noisy voter model

J. T. Cox ; Y. Peres ; Jeffrey Steif (Institutionen för matematiska vetenskaper, matematik)
Annals of Applied Probability (1050-5164). Vol. 26 (2016), 2, p. 917-932.
[Artikel, refereegranskad vetenskaplig]

Given a continuous time Markov Chain {q (x, y)} on a finite set S, the associated noisy voter model is the continuous time Markov chain on {0, 1}(S), which evolves in the following way: (1) for each two sites x and y in S, the state at site x changes to the value of the state at site y at rate q (x, y); (2) each site rerandomizes its state at rate 1. We show that if there is a uniform bound on the rates {q (x, y)} and the corresponding stationary distributions are almost uniform, then the mixing time has a sharp cutoff at time log vertical bar S vertical bar/2 with a window of order 1. Lubetzky and Sly proved cutoff with a window of order 1 for the stochastic Ising model on toroids; we obtain the special case of their result for the cycle as a consequence of our result. Finally, we consider the model on a star and demonstrate the surprising phenomenon that the time it takes for the chain started at all ones to become close in total variation to the chain started at all zeros is of smaller order than the mixing time.

Nyckelord: Noisy voter models; mixing times for Markov chains; cutoff phenomena; ising-model; Mathematics



Denna post skapades 2016-05-31. Senast ändrad 2016-07-05.
CPL Pubid: 237139

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)

Ämnesområden

Matematik

Chalmers infrastruktur