Home > Search Results: Ditrich, Jakub
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Mixing of Markov chains - lower bounds for mixing
 Ditrich, Jakub ; Prokešová, Michaela (advisor) ; Swart, Jan (referee)
The focus of the thesis is the convergence of irreducible aperiodic homoge- neous Markov chains with a finite and discrete set of states. Specifically, lower bounds on the time needed for the chain's marginal probability distribution to be sufficiently close to the stationary distribution, so called mixing time. Multiple methods are introdu- ced, properly motivated and proven. Finally, each method is demonstrated on a suitable example. The result is an overview of three methods that can be used to derive lower bounds for mixing time. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English