Existence Condition of Strong Stationary Times for Continuous Time Markov Chains on Discrete Graphs

Guillaume Copros ()
Additional contact information
Guillaume Copros: Institut de Mathématiques de Toulouse

Journal of Theoretical Probability, 2018, vol. 31, issue 3, 1679-1728

Abstract: Abstract We consider a random walk on a discrete connected graph having some infinite branches plus finitely many vertices with finite degrees. We find the generator of a strong stationary dual in the sense of Fill, and use it to find some equivalent condition to the existence of a strong stationary time. This strong stationary dual process lies in the set of connected compact sets of the compactification of the graph. When the graph is $$\mathbb Z$$ Z , the set here is simply the set of (possibly infinite) segments of $$\mathbb Z$$ Z .

Keywords: Strong stationary time; Strong stationary dual; Random walk; Discrete graph; 60J27; 60G40 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10959-017-0746-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:31:y:2018:i:3:d:10.1007_s10959-017-0746-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1007/s10959-017-0746-4

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().