A hard-core model on a Cayley tree: An example of a loss network

Iouri M. Soukhov, U. A. Rozikov

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

The paper is about a nearest-neighbor hard-core model, with fugacity λ > 0, on a homogeneous Cayley tree of order k (with k + 1 neighbors). This model arises as as a simple example of a loss network with a nearest-neighbor exclusion. We focus on Gibbs measures for the hard core model, in particular on 'splitting' Gibbs measures generating a Markov chain along each path on the tree. In this model, ∀λ > 0 and k ≥ 1, there exists a unique translation-invariant splitting Gibbs measure μ*. Define λc = 1/(k - 1) × (k/(k-1)k. Then: (i) for λ ≥ λc, the Gibbs measure is unique (and coincides with the above measure μ*), (ii) for λ > λc, in addition to μ*, there exist two distinct translation-periodic measures, μ+ and μ-, taken to each other by the unit space shift. Measures μ+ and μ- are extreme ∀λ > λc. We also construct a continuum of distinct, extreme, non-translational-invariant, splitting Gibbs measures. For λ > 1/(√k - 1) × (√k/√k - 1))k, measure μ* is not extreme (this result can be improved). Finally, we consider a model with two fugacities, λe and λo, for even and odd sites. We discuss open problems and state several related conjectures.

Original languageEnglish (US)
Pages (from-to)197-212
Number of pages16
JournalQueueing Systems
Volume46
Issue number1-2
StatePublished - Jan 1 2004

Fingerprint

Markov processes
Nearest neighbor
Markov chain
Exclusion

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics

Cite this

@article{fe5a5602cf53486cb636ba69c259099f,
title = "A hard-core model on a Cayley tree: An example of a loss network",
abstract = "The paper is about a nearest-neighbor hard-core model, with fugacity λ > 0, on a homogeneous Cayley tree of order k (with k + 1 neighbors). This model arises as as a simple example of a loss network with a nearest-neighbor exclusion. We focus on Gibbs measures for the hard core model, in particular on 'splitting' Gibbs measures generating a Markov chain along each path on the tree. In this model, ∀λ > 0 and k ≥ 1, there exists a unique translation-invariant splitting Gibbs measure μ*. Define λc = 1/(k - 1) × (k/(k-1)k. Then: (i) for λ ≥ λc, the Gibbs measure is unique (and coincides with the above measure μ*), (ii) for λ > λc, in addition to μ*, there exist two distinct translation-periodic measures, μ+ and μ-, taken to each other by the unit space shift. Measures μ+ and μ- are extreme ∀λ > λc. We also construct a continuum of distinct, extreme, non-translational-invariant, splitting Gibbs measures. For λ > 1/(√k - 1) × (√k/√k - 1))k, measure μ* is not extreme (this result can be improved). Finally, we consider a model with two fugacities, λe and λo, for even and odd sites. We discuss open problems and state several related conjectures.",
author = "Soukhov, {Iouri M.} and Rozikov, {U. A.}",
year = "2004",
month = "1",
day = "1",
language = "English (US)",
volume = "46",
pages = "197--212",
journal = "Queueing Systems",
issn = "0257-0130",
publisher = "Springer Netherlands",
number = "1-2",

}

A hard-core model on a Cayley tree : An example of a loss network. / Soukhov, Iouri M.; Rozikov, U. A.

In: Queueing Systems, Vol. 46, No. 1-2, 01.01.2004, p. 197-212.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A hard-core model on a Cayley tree

T2 - An example of a loss network

AU - Soukhov, Iouri M.

AU - Rozikov, U. A.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - The paper is about a nearest-neighbor hard-core model, with fugacity λ > 0, on a homogeneous Cayley tree of order k (with k + 1 neighbors). This model arises as as a simple example of a loss network with a nearest-neighbor exclusion. We focus on Gibbs measures for the hard core model, in particular on 'splitting' Gibbs measures generating a Markov chain along each path on the tree. In this model, ∀λ > 0 and k ≥ 1, there exists a unique translation-invariant splitting Gibbs measure μ*. Define λc = 1/(k - 1) × (k/(k-1)k. Then: (i) for λ ≥ λc, the Gibbs measure is unique (and coincides with the above measure μ*), (ii) for λ > λc, in addition to μ*, there exist two distinct translation-periodic measures, μ+ and μ-, taken to each other by the unit space shift. Measures μ+ and μ- are extreme ∀λ > λc. We also construct a continuum of distinct, extreme, non-translational-invariant, splitting Gibbs measures. For λ > 1/(√k - 1) × (√k/√k - 1))k, measure μ* is not extreme (this result can be improved). Finally, we consider a model with two fugacities, λe and λo, for even and odd sites. We discuss open problems and state several related conjectures.

AB - The paper is about a nearest-neighbor hard-core model, with fugacity λ > 0, on a homogeneous Cayley tree of order k (with k + 1 neighbors). This model arises as as a simple example of a loss network with a nearest-neighbor exclusion. We focus on Gibbs measures for the hard core model, in particular on 'splitting' Gibbs measures generating a Markov chain along each path on the tree. In this model, ∀λ > 0 and k ≥ 1, there exists a unique translation-invariant splitting Gibbs measure μ*. Define λc = 1/(k - 1) × (k/(k-1)k. Then: (i) for λ ≥ λc, the Gibbs measure is unique (and coincides with the above measure μ*), (ii) for λ > λc, in addition to μ*, there exist two distinct translation-periodic measures, μ+ and μ-, taken to each other by the unit space shift. Measures μ+ and μ- are extreme ∀λ > λc. We also construct a continuum of distinct, extreme, non-translational-invariant, splitting Gibbs measures. For λ > 1/(√k - 1) × (√k/√k - 1))k, measure μ* is not extreme (this result can be improved). Finally, we consider a model with two fugacities, λe and λo, for even and odd sites. We discuss open problems and state several related conjectures.

UR - http://www.scopus.com/inward/record.url?scp=3543148922&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3543148922&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:3543148922

VL - 46

SP - 197

EP - 212

JO - Queueing Systems

JF - Queueing Systems

SN - 0257-0130

IS - 1-2

ER -