IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v20y1985i2p247-256.html
   My bibliography  Save this article

Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional lattice

Author

Listed:
  • Zachary, Stan

Abstract

Let [Pi] be a homogenous Markov specification associated with a countable state space S and countably infinite parameter space A possessing a neighbor relation [small tilde] such that (A,[small tilde]) is the regular tree with d +1 edges meeting at each vertex. Let ([pi])be the simplex of corresponding Markov random fields. We show that if [Pi] satisfies a 'boundedness' condition then ([pi]).We further study the structure of ([pi]) when [Pi] is either attractive or repulsive with respect to a linear ordering on S. When d = 1, so that (A, [small tilde]) is the one-dimensional lattice, we relax the requirement of homogeneity to that of stationarity; here we give sufficient conditions for ([pi]) and for ([pi])to have precisely one member.

Suggested Citation

  • Zachary, Stan, 1985. "Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional lattice," Stochastic Processes and their Applications, Elsevier, vol. 20(2), pages 247-256, September.
    • Handle: RePEc:eee:spapps:v:20:y:1985:i:2:p:247-256
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(85)90213-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:20:y:1985:i:2:p:247-256. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.