A tight lower bound on the cover time for random walks on graphs (Q4845080): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.3240060406 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170807097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to covering problems for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal cover times for random walks on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collisions Among Random Walks on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Brownian motion on spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Lower Bounding the Cover Time / rank
 
Normal rank

Latest revision as of 17:04, 23 May 2024

scientific article; zbMATH DE number 792495
Language Label Description Also known as
English
A tight lower bound on the cover time for random walks on graphs
scientific article; zbMATH DE number 792495

    Statements