2005
DOI: 10.2991/jnmp.2005.12.3.7
|View full text |Cite
|
Sign up to set email alerts
|

A Three State Hard-Core Model on a Cayley Tree

Abstract: We consider a nearest-neighbor hard-core model, with three states , on a homogeneous Cayley tree of order k (with k + 1 neighbors). This model arises as a simple example of a loss network with nearest-neighbor exclusion. The state σ(x) at each node x of the Cayley tree can be 0, 1 and 2. We have Poisson flow of calls of rate λ at each site x, each call has an exponential duration of mean 1. If a call finds the node in state 1 or 2 it is lost. If it finds the node in state 0 then things depend on the state of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
20
0
17

Year Published

2006
2006
2015
2015

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 45 publications
(39 citation statements)
references
References 20 publications
2
20
0
17
Order By: Relevance
“…These problems were solved in [4] in the case where G = wrench. We consider the cases G = hinge, G = pipe, and G = wand.…”
Section: Definitionmentioning
confidence: 99%
“…These problems were solved in [4] in the case where G = wrench. We consider the cases G = hinge, G = pipe, and G = wand.…”
Section: Definitionmentioning
confidence: 99%
“…The simplicity of the Cayley tree allows describing a rather wide class of GMs for models without "good" symmetries (see [9] and [15]) and with competing interactions (see, e.g., [16]). …”
Section: Discussionmentioning
confidence: 99%
“…There are four such models: wrench, wand, hinge, and pipe [2]. It is known (see [16,19,21]) that (i) for the wrench and pipe cases ∀λ > 0 and k ≥ 1, there exists a unique TISGM; (ii) for hinge (resp. wand) case at k = 2 if λ < λ cr = 9/4 (resp.…”
mentioning
confidence: 99%