Tight inequalities among set hitting times in Markov chains (Q3190216): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1209.0039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Inequalities for Reversible Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times for uniformly ergodic Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum hitting time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing and hitting times for finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times are hitting times of large sets / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128271519 / rank
 
Normal rank

Latest revision as of 09:01, 30 July 2024

scientific article
Language Label Description Also known as
English
Tight inequalities among set hitting times in Markov chains
scientific article

    Statements

    Tight inequalities among set hitting times in Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2014
    0 references
    Markov chains
    0 references
    hitting times
    0 references

    Identifiers