On the public citation graph

Cover time and mixing time of random walks on dynamic graphs

0 signed · 69 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470277331openalex-snapshot
The Probabilistic Method
inferredcites →https://doi.org/10.1002/rsa.3240060106openalex-snapshot
A tight upper bound on the cover time for random walks on graphs
inferredcites →https://doi.org/10.1002/rsa.3240060406openalex-snapshot
A tight lower bound on the cover time for random walks on graphs
inferredcites →https://doi.org/10.1007/11558989_2openalex-snapshot
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
inferredcites →https://doi.org/10.1007/3-540-44676-1_38openalex-snapshot
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
inferredcites →https://doi.org/10.1007/3-540-45841-7_2openalex-snapshot
Models and Techniques for Communication in Dynamic Networks
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_11openalex-snapshot
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
inferredcites →https://doi.org/10.1007/978-3-642-25873-2_31openalex-snapshot
On the Power of Waiting When Exploring Public Transportation Systems
inferredcites →https://doi.org/10.1007/978-3-642-33651-5_10openalex-snapshot
Fast Distributed Computation in Dynamic Networks via Random Walks
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_42openalex-snapshot
Randomized Rumor Spreading in Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-662-45174-8_23openalex-snapshot
Random Walks on Evolving Graphs with Recurring Topologies
inferredcites →https://doi.org/10.1007/978-3-662-48653-5_34openalex-snapshot
Smoothed Analysis of Dynamic Networks
inferredcites →https://doi.org/10.1007/s00446-011-0133-9openalex-snapshot
Parsimonious flooding in dynamic graphs
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/j.adhoc.2003.08.001openalex-snapshot
Active query forwarding in sensor networks
inferredcites →https://doi.org/10.1016/s1389-1286(99)00016-xopenalex-snapshot
Measuring index quality using random walks on the Web
inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot
Probability and Computing
inferredcites →https://doi.org/10.1017/s0963548300000390openalex-snapshot
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
inferredcites →https://doi.org/10.1017/s0963548311000125openalex-snapshot
Many Random Walks Are Faster Than One
inferredcites →https://doi.org/10.1017/s0963548398003538openalex-snapshot
On the Cover Time for Random Walks on Random Graphs
inferredcites →https://doi.org/10.1080/15427951.2004.10129078openalex-snapshot
Crawling on Simple Models of Web Graphs
inferredcites →https://doi.org/10.1080/17445760.2012.668546openalex-snapshot
Time-varying graphs and dynamic networks
inferredcites →https://doi.org/10.1090/mbk/107openalex-snapshot
Markov Chains and Mixing Times
inferredcites →https://doi.org/10.1098/rspa.2009.0456openalex-snapshot
Evolving graphs: dynamical models, inverse problems and propagation
inferredcites →https://doi.org/10.1109/infcom.2004.1354487openalex-snapshot
Random walks in peer-to-peer networks
inferredcites →https://doi.org/10.1109/ipdps.2009.5160986openalex-snapshot
Information spreading in stationary Markovian evolving graphs
inferredcites →https://doi.org/10.1109/mnet.2004.1337732openalex-snapshot
Building a reference combinatorial model for MANETs
inferredcites →https://doi.org/10.1109/nca.2007.35openalex-snapshot
On the Evaluation of Shortest Journeys in Dynamic Networks
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1109/sfcs.2001.959890openalex-snapshot
Simple routing strategies for adversarial systems
inferredcites →https://doi.org/10.1109/sfcs.2003.1238221openalex-snapshot
Gossip-based computation of aggregate information
inferredcites →https://doi.org/10.1137/0218077openalex-snapshot
Approximating the Permanent
inferredcites →https://doi.org/10.1137/090756053openalex-snapshot
Flooding Time of Edge-Markovian Evolving Graphs
inferredcites →https://doi.org/10.1137/090769752openalex-snapshot
Correctness of Gossip-Based Membership under Message Loss
inferredcites →https://doi.org/10.1137/1.9781611973105.52openalex-snapshot
On the Complexity of Information Spreading in Dynamic Networks
inferredcites →https://doi.org/10.1145/1022630.1022635openalex-snapshot
Connectivity in evolving graph with geometric properties
inferredcites →https://doi.org/10.1145/1806689.1806760openalex-snapshot
Distributed computation in dynamic networks
inferredcites →https://doi.org/10.1145/1959045.1959064openalex-snapshot
Dynamic networks
inferredcites →https://doi.org/10.1145/1993806.1993808openalex-snapshot
Coordinated consensus in dynamic networks
inferredcites →https://doi.org/10.1145/1993806.1993885openalex-snapshot
Faster information dissemination in dynamic networks via network coding
inferredcites →https://doi.org/10.1145/984622.984663openalex-snapshot
Efficient and robust query processing in dynamic environments using random walk techniques
inferredcites →https://doi.org/10.1214/aop/1176991894openalex-snapshot
Covering Problems for Brownian Motion on Spheres
inferredcites →https://doi.org/10.5555/644108.644134openalex-snapshot
The cover time of sparse random graphs.
inferredcites →https://doi.org/10.5948/upo9781614440222openalex-snapshot
Random Walks and Electric Networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.21164openalex-snapshot
Reversible random walks on dynamic graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_20openalex-snapshot
Mobile Agents on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_7openalex-snapshot
Random Walks on Randomly Evolving Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-84910-8_17openalex-snapshot
The Effect of Agents’ Diversities on the Running Time of the Random Walk-Based Rendezvous Search
inferred← citeshttps://doi.org/10.1007/s00440-025-01375-8openalex-snapshot
Mixing of fast random walks on dynamic random permutations
inferred← citeshttps://doi.org/10.1007/s42486-019-00021-2openalex-snapshot
Speed up random walk by leveraging community affiliation information
inferred← citeshttps://doi.org/10.1016/j.chaos.2024.114523openalex-snapshot
Understanding influence of fractal generative manner on structural properties of tree networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.005openalex-snapshot
On temporal graph exploration
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103797openalex-snapshot
An analysis of load-balancing algorithms on edge-Markovian evolving graphs
inferred← citeshttps://doi.org/10.1016/j.spa.2022.07.009openalex-snapshot
Linking the mixing times of random walks on static and dynamic random graphs
inferred← citeshttps://doi.org/10.1016/j.spa.2025.104737openalex-snapshot
The phase transition of the voter model on evolving scale-free networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114904openalex-snapshot
Adaptive collective responses to local stimuli in anonymous dynamic networks
inferred← citeshttps://doi.org/10.1038/s44459-025-00022-xopenalex-snapshot
From federated learning to $${\mathbb{X}}$$-Learning: breaking the barriers of decentrality through random walks
inferred← citeshttps://doi.org/10.1039/c9cp05014kopenalex-snapshot
Understanding the effect of nanoconfinement on the structure of water hydrogen bond networks
inferred← citeshttps://doi.org/10.1145/3323165.3323204openalex-snapshot
The Dispersion Time of Random Walks on Finite Graphs
inferred← citeshttps://doi.org/10.1145/3382734.3405720openalex-snapshot
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3490148.3538571openalex-snapshot
Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks
inferred← citeshttps://doi.org/10.1214/24-aihp1513openalex-snapshot
Recurrence, transience and degree distribution for the Tree Builder Random Walk
inferred← citeshttps://doi.org/10.1287/moor.2023.0060openalex-snapshot
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?
inferred← citeshttps://doi.org/10.17863/cam.41384openalex-snapshot
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
inferred← citeshttps://doi.org/10.17863/cam.54835openalex-snapshot
Random Walks on Randomly Evolving Graphs
inferred← citeshttps://doi.org/10.17863/cam.74543openalex-snapshot
The Impact of Randomisation in Load Balancing and Random Walks
inferred← citeshttps://doi.org/10.30757/alea.v21-73openalex-snapshot
Bounds on Mixing Time for Time-Inhomogeneous Markov Chains
inferred← citeshttps://doi.org/10.3390/info12050195openalex-snapshot
Edge-Based Missing Data Imputation in Large-Scale Environments
inferred← citeshttps://doi.org/10.70675/f1e1175fz2135z4a7bzba8cz07bb8651babfopenalex-snapshot
Graceful Degradation and Speculation for Robots in Highly Dynamic Environments
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.