Home > Search Results: recid:451135
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 

Warning: Requested record does not seem to exist.
Random walks on networks, hitting times and cover times
 Havránek, Jiří ; Prokešová, Michaela (advisor) ; Večeř, Jan (referee)
This thesis studies the cover time of random walks on finite connected graphs. Work contains the derivation of upper and lower estimates of cover time which allows us to focus on hitting time instead of cover time. We show that in some cases the problem of searching for the hitting time can be further simplified with the usage of the electrical networks, which can provide a different model for considered random walks and can help finding the hitting time through the effective resistance between some vertices. This procedure is used to find the upper and lower bounds for specific families of structures, which ilustrates that in some cases the bounds are asymptotically very tight and in other cases they give poor results. 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