forgot password?
register here
Research articles
  search articles
  reviews guidelines
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
Members: 2923
Articles: 1'999'196
Articles rated: 2574

01 October 2020
  » arxiv » 2006.1426

 Article overview

Coalescing and branching simple symmetric exclusion process
Ivailo Hartarsky ; Fabio Martinelli ; Cristina Toninelli ;
Date 2 Jun 2020
AbstractMotivated by kinetically constrained interacting particle systems (KCM), we consider a reversible coalescing and branching simple exclusion process on a general finite graph $G=(V,E)$ dual to the biased voter model on $G$. Our main goal are tight bounds on its logarithmic Sobolev constant and relaxation time, with particular focus on the delicate slightly supercritical regime in which the equilibrium density of particles tends to zero as $|V| ightarrow infty$. Our results allow us to recover very directly and improve to $ell^p$-mixing, $pge 2$, and to more general graphs, the mixing time results of Pillai and Smith for the FA-$1$f (or $1$-neighbour) KCM on the discrete $d$-dimensional torus. In view of applications to the more complex FA-$j$f KCM, $j>1$, we also extend part of the analysis to an analogous process with a more general product state space.
Source arXiv, 2006.1426
Services Forum | Review | PDF | Favorites   
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
of broad interest:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser CCBot/2.0 (
» my Online CV
» Free

News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2020 - Scimetrica