Pages that link to "Item:Q4234053"
From MaRDI portal
The following pages link to Efficient stopping rules for Markov chains (extended abstract) (Q4234053):
Displaying 21 items.
- Exact mixing times for random walks on trees (Q354448) (← links)
- Mixing times are hitting times of large sets (Q495704) (← links)
- The best mixing time for random walks on trees (Q503614) (← links)
- The optimal sink and the best source in a Markov chain (Q634173) (← links)
- Faster mixing and small bottlenecks (Q863483) (← links)
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem (Q1304617) (← links)
- Stopping tests for Markov chain Monte-Carlo methods (Q1577407) (← links)
- Mixing time bounds via bottleneck sequences (Q1756546) (← links)
- Exact mixing in an unknown Markov chain (Q1897681) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- On approximating the stationary distribution of time-reversible Markov chains (Q1987513) (← links)
- The access time of random walks on trees with given partition (Q2141241) (← links)
- On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment (Q2150676) (← links)
- On Approximating the Stationary Distribution of Time-reversible Markov Chains (Q3304112) (← links)
- Optimal stopping of stochastic transport minimizing submartingale costs (Q3382260) (← links)
- Relative fixed-width stopping rules for Markov chain Monte Carlo simulations (Q3449023) (← links)
- Reversal of Markov Chains and the Forget Time (Q4212880) (← links)
- Exit Frequency Matrices for Finite Markov Chains (Q4933599) (← links)
- On Optimal Multiple Stopping of Markov Sequences (Q4954362) (← links)
- A Hitting Time Formula for the Discrete Green's Function (Q5366895) (← links)
- Stopping Probabilities for Patterns in Markov Chains (Q5416558) (← links)
