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

Monotonicity properties of exclusion sensitivity

Malin Palö Forsström (Institutionen för matematiska vetenskaper, matematisk statistik)
Electronic Journal of Probability (1083-6489). Vol. 21 (2016), p. 45.
[Artikel, refereegranskad vetenskaplig]

In [3], exclusion sensitivity and exclusion stability for symmetric exclusion processes on graphs were defined as natural analogues of noise sensitivity and noise stability in this setting.As these concepts were defined for any sequence of connected graphs, it is natural to study the monotonicity properties of these definitions, and in particular, if some graphs are in some sense more stable or sensitive than others.The main purpose of this paper is to answer one such question which was stated explicitly in [3].In addition, we get results about the eigenvectors and eigenvalues of symmetric exclusion processes on complete graphs. © 2016, University of Washington.All rights reserved.

Nyckelord: Exclusion process, Exclusion sensitivity, Noise sensitivity

Denna post skapades 2016-12-19. Senast ändrad 2017-05-15.
CPL Pubid: 246244


Läs direkt!

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

Institutioner (Chalmers)

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



Chalmers infrastruktur