IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v2y2000i1d10.1023_a1010011418887.html
   My bibliography  Save this article

Superposition of Spatially Interacting Aggregated Continuous Time Markov Chains

Author

Listed:
  • Frank Ball
  • Geoffrey Yeo

    (Murdoch University)

Abstract

A system s{ X(t)} = {X 1(t),X 2(t),..., X N(t)} of N interacting time reversible continuous time Markov chains is considered. The state space of each of the processes {X i(t)} (i = 1, 2,...,N) is partitioned into two aggregates. Interaction between the processes {X i(t)},{X 2(t)},...,{X N(t)} is introduced by allowing the transition rates of an individual process at time t to depend on the configuration of aggregates occupied by the other N - 1 processes at that time. The motivation for this work comes from ion channel modeling, where {(X}(t)} describes the gating mechanisms of N channels and the partitioning of the state space of {X i(t)} correspond to whether the channel is conducting or not. Let S(t) denote the number of conducting channels at time t. For a time-reversible class of such processes, expressions are derived for the mean and probability density function of the sojourns of {S(t)} at its different levels when {X(t)} is in equilibrium. Particular attention is paid to the situation when the N channels are located on a circle with nearest neighbor interaction. Necessary and sufficient conditions for a general co-operative multiple channel system to be time reversible are derived.

Suggested Citation

  • Frank Ball & Geoffrey Yeo, 2000. "Superposition of Spatially Interacting Aggregated Continuous Time Markov Chains," Methodology and Computing in Applied Probability, Springer, vol. 2(1), pages 93-115, April.
  • Handle: RePEc:spr:metcap:v:2:y:2000:i:1:d:10.1023_a:1010011418887
    DOI: 10.1023/A:1010011418887
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1010011418887
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1010011418887?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:spr:metcap:v:2:y:2000:i:1:d:10.1023_a:1010011418887. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.