Cover time in edge-uniform stochastically-evolving graphs

DOI10.1007/978-3-319-69084-1_33MaRDI QIDQ5045453zbMATH OpenOpenAlexFDO

Authors Ioannis Lamprou, Russell Martin, P. G. Spirakis

Publication date 4 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-69084-1_33

zbMATH Keywords

random walkcover timedynamic graphsedge independencestochastically-evolving network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Cover time in edge-uniform stochastically-evolving graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• On a cover time problem on a dynamic graph with steps at random times
• Cover time and mixing time of random walks on dynamic graphs
• Edge cover time for regular graphs

Cited in

(6)

• On a cover time problem on a dynamic graph with steps at random times
• Cover time in edge-uniform stochastically-evolving graphs
• Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
• Asymptotic properties of stochastic timed event graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• The stochastic weighted complexity of a group covering of a digraph

This page was built for publication: Cover time in edge-uniform stochastically-evolving graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045453)