Cover time and mixing time of random walks on dynamic graphs

Keyphrases

• Adversary 50%
• Algorithmic Setting 25%
• Cover Time 100%
• Distributed Computing 25%
• Dynamic Graph 100%
• Dynamic Networks 25%
• Expected Time 25%
• Information Spreading 25%
• Lazy Random Walks 25%
• Local Data 25%
• Memory Requirements 25%
• Mixing Time 75%
• Mixing Time of Random Walks 100%
• Network Exploration 25%
• Oblivious Adversary 25%
• Peer-to-peer Networks 25%
• Random Walk 50%
• Random Walks on Graphs 25%
• Rapid Mixing 25%
• Simple Random Walk 75%
• Simple Strategy 25%
• Static Graph 50%
• Stationary Distribution 25%
• Well-connected 25%
• Wireless Networks 25%

Mathematics

• Polynomial 75%
• Random Walk 100%
• Simple Random Walk 75%
• Time Step 25%

Computer Science

• Distributed Computing 14%
• Distributed Nature 14%
• Dynamic Network 14%
• Memory Requirement 14%
• Peer to Peer Networks 14%
• Random Walk 100%
• Wireless Networks 14%