Covering with blocks in the non-symmetric case
From MaRDI portal
Publication:1345083
DOI10.1007/BF02213458zbMATH Open0814.60008OpenAlexW1966244536MaRDI QIDQ1345083FDOQ1345083
Authors: Tamás F. Móri 
Publication date: 26 February 1995
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02213458
Recommendations
Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Random walk covering of some special trees
- Threshold limits for cover times
- Covering problems for Markov chains
- On the time taken by random walks on finite groups to visit every state
- Random walks on highly symmetric graphs
- On the cover time of random walks on graphs
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- Covering times of random walks on bounded degree trees and other graphs
- An introduction to covering problems for random walks on graphs
- Some sample path properties of a random walk on the cube
- More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run
- Large deviation results for waiting times in repeated experiments
- Random walks on \(Z^n_2\)
- Expected cover times of random walks on symmetric graphs
- A bound for the covering time of random walks on graphs
- On the waiting time till each of some given patterns occurs as a run
- Maximum Waiting Times are Asymptotically Independent
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Covering with blocks in the non-symmetric case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345083)
