Positive Systems
DOI: 10.1007/3-540-34774-7_22
|View full text |Cite
|
Sign up to set email alerts
|

Convergence Times for Parallel Markov Chains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…(t) = ℓ ,denote the first return time to ℓ after s E T These times are well defined: since, as we assume the chain to be positively recurent, every mean hitting time is finite. Under the hypotheses of Theorem 3.3,(37) lim a→∞ P (S s ℓ > s + β a ) = 0 .Proof. Define t a := s E T (a)…”
mentioning
confidence: 92%
See 1 more Smart Citation
“…(t) = ℓ ,denote the first return time to ℓ after s E T These times are well defined: since, as we assume the chain to be positively recurent, every mean hitting time is finite. Under the hypotheses of Theorem 3.3,(37) lim a→∞ P (S s ℓ > s + β a ) = 0 .Proof. Define t a := s E T (a)…”
mentioning
confidence: 92%
“…An alternative, more probabilistic approach proposed in the last decade [52,53,54,40] offers some advantages regarding the above criticism. In this approach, cutoff is associated to the existence of an appropriate drift in stochastic processes or sampling schemes, and arguments are based on the behavior of hitting times [36,37,4]. Furthermore, the approach includes some general criteria for the existence of cut-off as illustrated by Proposition 3.1 below (taken from [40]).…”
Section: Introductionmentioning
confidence: 99%