Pymar, Richard and Rivera, N. (2024) Mixing of the symmetric beta-binomial splitting process on arbitrary graphs. Annales de l'Institut Henri Poincare (B) Probability and Statistics , ISSN 0246-0203. (In Press)
|
Text
AIHP2307-009R1A0 (3).pdf - Author's Accepted Manuscript Available under License Creative Commons Attribution. Download (512kB) | Preview |
Abstract
We study the mixing time of the symmetric beta-binomial splitting process on finite weighted connected graphs G = (V,E,{re}e∈E) with vertex set V , edge set E and positive edge-weights re > 0 for e ∈ E. This is an interacting particle system with a fixed number of particles that updates through vertex-pairwise interactions which redistribute particles. We show that the mixing time of this process can be upper-bounded in terms of the maximal expected meeting time of two independent random walks on G. Our techniques involve using a process similar to the chameleon process invented in [18] to bound the mixing time of the exclusion process.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Richard Pymar |
| Date Deposited: | 03 Sep 2024 12:15 |
| Last Modified: | 03 Oct 2024 00:10 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/54203 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
