Home > Search Results: keywords:"reverzibilní Markovův řetězec"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Random walks on networks and mixing of Markov chains
 Gemrotová, Kateřina ; Prokešová, Michaela (advisor) ; Pawlas, Zbyněk (referee)
The thesis presents the study of deriving upper bounds of the speed of convergence of reversible Markov chains with discrete time and discrete finite space state to their stationary distributions. We express the derived upper bound in terms of several variables and we make use of the theory of electrical networks, which will help us to represent random walks on a graph. The result of this thesis will be simply obtainable upper bound of mixing time of random walks on connected graphs with an arbitrary number of vertices and edges. Partial results will be demonstrated on simple examples and counterexamples. 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