Exclusion processes with multiple interactions (Q2485480)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2192257
Language Label Description Also known as
default for all languages
No label defined
    English
    Exclusion processes with multiple interactions
    scientific article; zbMATH DE number 2192257

      Statements

      Exclusion processes with multiple interactions (English)
      0 references
      5 August 2005
      0 references
      As a generalization of the exclusion process, the permutation process is introduced and its basic properties are studied. Let \(S\) be a countable set and \(\Sigma\) be a set of permutations of finitely many points of \(S\). For any cylinder function \(f(\eta)\) of \( \eta \in \{0,1\}^S\), \(\Omega\) is defined by \[ (\Omega f)(\eta) = \sum_{\sigma\in\Sigma}q(\sigma)[f(\sigma(\eta)) - f(\eta)]. \] Under a suitable condition on \(q: \Sigma \to [0,\infty)\), the process \(\eta_t\) valued in \(\{0,1\}^S\) with generator \(\Omega\) is a well-defined Feller process, which is called the permutation process. For \(S=\mathbb{R}\), the following properties are proved under irreducibility, translational invariance as well as other technical conditions on \(q\): 1. The set of extreme points of the class of stationary distributions of the symmetric permutation process is given by \(\{\nu_{\rho} :0\leq \rho \leq 1\}\). 2. The set of extreme points of the class of shift invariant stationary distributions of the permutation process is given by \(\{\nu_{\rho} :0\leq \rho \leq 1\}\). \noindent Here, \( \nu_{\rho} \) is the homogeneous product measure on \(\{0,1\}^S\) with marginal \(\rho\). The proofs proceed along the line of those for the exclusion process by modifying and extending them.
      0 references
      interacting particle systems
      0 references
      symmetric exclusion processes
      0 references
      couplings
      0 references
      permutations
      0 references
      0 references

      Identifiers