… In the context of this correspondence, (DC) was first introduced by Kontoyiannis and Suhov
[11], where its properties are discussed in greater detail. Here we note that (DC) holds for iid …

This paper is a follow-up of our recent papers Chulaevsky and Suhov (Commun Math Phys
283:479–489, 2008 ) and Chulaevsky and Suhov (Commun Math Phys in press, 2009 ) …

… Write x < y if the path from x0 to y goes through y. Call vertex y a direct successor of x if y>x
and x,y are nearest neighbors. Denote by S(x) the set of direct successors of x. Note that any …

We consider some models of classical statistical mechanics which admit an investigation by
means of the theory of dominant ground states. Our models are related to the Gibbs …

… The probability that girl x will beat girl y in any game that they play against each other is sx/
($x+Sy) for x, y = {A,B,C}, xy, where SA, SB, Sc represent the playing strengths of the three …

… Write x < y if the path from x0 to y goes through x. Call vertex ya direct successor of x if y>x
and x, y are nearest neighbours. Denote by S(x) the set of direct successors of x. Observe that …

This paper is motivated by a view that there is practical value in being able to measure
aspects of complexity in industrial, particularly manufacturing, systems. We address, at a …

… Write x<y if the path from x0 to y goes through y. Call vertex ya direct successor of x if y>x
and x, y are nearest neighbors. Denote by S(x) the set of direct successors of x. Note that any …

We extend the results of Vvedenskaya, Dobrushin and Karpelevich to Jackson networks.
Each node $j, 1 \leq j \leq J$ of the network consists of N identical channels, each with an …

… Given Y ∈ M and (x, v) ∈ Y , we denote by D(x,v)Y the “dilation of Y ”, ie, the element of M(a)
obtained as follows. We label the points (x, v) ∈ Y by the integers n ∈ Z1, according to the …