On the public citation graph

Bounds on the cover time

https://doi.org/10.1007/bf01048273
0 signed · 116 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/j.1538-7305.1982.tb03100.xopenalex-snapshot
Some Extremal Markov Chains
inferredcites →https://doi.org/10.1007/978-0-387-68276-1openalex-snapshot
Inequalities: Theory of Majorization and Its Applications
inferredcites →https://doi.org/10.1007/bf00535260openalex-snapshot
On the time taken by random walks on finite groups to visit every state
inferredcites →https://doi.org/10.1007/bf01048272openalex-snapshot
Lower bounds for covering times for reversible Markov chains and random walks on graphs
inferredcites →https://doi.org/10.1007/bf01048274openalex-snapshot
On the cover time of random walks on graphs
inferredcites →https://doi.org/10.1007/bf02579166openalex-snapshot
Eigenvalues and expanders
inferredcites →https://doi.org/10.1007/bfb0068322openalex-snapshot
Random walks on finite groups and rapidly mixing markov chains
inferredcites →https://doi.org/10.1016/0024-3795(81)90003-3openalex-snapshot
Bounds for eigenvalues of certain stochastic matrices
inferredcites →https://doi.org/10.1016/0890-5401(89)90067-9openalex-snapshot
Approximate counting, uniform generation and rapidly mixing Markov chains
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.1987.22openalex-snapshot
Eigenvalues and graph bisection: An average-case analysis
inferredcites →https://doi.org/10.1109/sfcs.1987.45openalex-snapshot
On the second eigenvalue of random regular graphs
inferredcites →https://doi.org/10.1109/sfcs.1988.21964openalex-snapshot
Bounds on the cover time
inferredcites →https://doi.org/10.1214/aop/1176993605openalex-snapshot
Minimization Algorithms and Random Walk on the $d$-Cube
inferredcites →https://doi.org/10.2307/2287859openalex-snapshot
Inequalities: Theory of Majorization and its Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.4627056openalex-extracted
inferred← citeshttps://doi.org/10.1002/qua.22396openalex-snapshot
Broder and Karlin's formula for hitting times and the Kirchhoff Index
inferred← citeshttps://doi.org/10.1002/rsa.10083openalex-snapshot
Deterministic approximation of the cover time
inferred← citeshttps://doi.org/10.1002/rsa.20151openalex-snapshot
The cover time of sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240040102openalex-snapshot
Markov chains on hypercubes: Spectral representations and several majorization relations
inferred← citeshttps://doi.org/10.1002/rsa.3240050204openalex-snapshot
Random walks on colored graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060406openalex-snapshot
A tight lower bound on the cover time for random walks on graphs
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5298openalex-snapshot
On the Mean and Variance of Cover Times for Random Walks on Graphs
inferred← citeshttps://doi.org/10.1007/11523468_55openalex-snapshot
On the Cover Time of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4612-0801-3_5openalex-snapshot
The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_8openalex-snapshot
Universal sequences and graph cover times A short survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-2553-7_3openalex-snapshot
Generating Samples
inferred← citeshttps://doi.org/10.1007/978-1-4757-3552-9_8openalex-snapshot
Sampling from Probability Distributions
inferred← citeshttps://doi.org/10.1007/978-3-030-14094-6_12openalex-snapshot
Reaching Consensus in Ad-Hoc Diffusion Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_30openalex-snapshot
Dispersion of Mobile Robots: The Power of Randomness
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_14openalex-snapshot
Deconstructing 1-Local Expanders
inferred← citeshttps://doi.org/10.1007/978-3-540-79705-0_6openalex-snapshot
Mobile Agent-Based Approach for Resource Discovery in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02427-6_8openalex-snapshot
Hitting Time Analysis for Stochastic Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_16openalex-snapshot
The Cover Time of Deterministic Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_23openalex-snapshot
Random Walks on Evolving Graphs with Recurring Topologies
inferred← citeshttps://doi.org/10.1007/bf01270385openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.1007/bfb0022436openalex-snapshot
More on the power of random walks: Uniform self-stabilizing randomized algorithms
inferred← citeshttps://doi.org/10.1007/bfb0032037openalex-snapshot
Computing boolean functions on anonymous networks
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
inferred← citeshttps://doi.org/10.1007/s11227-024-06146-1openalex-snapshot
Ant Mill: an adversarial traffic pattern for low-diameter direct networks
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90288-qopenalex-snapshot
Laplace eigenvalues of graphs—a survey
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90091-uopenalex-snapshot
On the time to traverse all edges of a graph
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.08.010openalex-snapshot
Radio cover time in hyper-graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.08.004openalex-snapshot
Optimizing random walk search algorithms in P2P networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.09.012openalex-snapshot
The power of choice in random walks: An empirical study
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.020openalex-snapshot
Random walks and the effective resistance sum rules
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114285openalex-snapshot
A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.009openalex-snapshot
On certain connectivity properties of the internet topology
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.108151openalex-snapshot
MDMD options discovery for accelerating exploration in sparse-reward domains
inferred← citeshttps://doi.org/10.1016/j.laa.2010.03.014openalex-snapshot
Sum rules for hitting times of Markov chains
inferred← citeshttps://doi.org/10.1016/j.peva.2005.01.002openalex-snapshot
Random walks in peer-to-peer networks: Algorithms and evaluation
inferred← citeshttps://doi.org/10.1016/j.spl.2011.12.012openalex-snapshot
On partial sums of hitting times
inferred← citeshttps://doi.org/10.1016/j.spl.2020.108715openalex-snapshot
Lower bounds on partial sums of expected hitting times
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.065openalex-snapshot
On the cover time and mixing time of random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.010openalex-snapshot
Tight bounds for the cover time of multiple random walks
inferred← citeshttps://doi.org/10.1016/s0169-7161(01)19009-7openalex-snapshot
Random walk and fluctuation theory
inferred← citeshttps://doi.org/10.1017/s0305004100068079openalex-snapshot
Hitting times for random walks on vertex-transitive graphs
inferred← citeshttps://doi.org/10.1017/s0963548311000125openalex-snapshot
Many Random Walks Are Faster Than One
inferred← citeshttps://doi.org/10.1017/s0963548313000552openalex-snapshot
Greedy Random Walk
inferred← citeshttps://doi.org/10.1017/s0963548398003538openalex-snapshot
On the Cover Time for Random Walks on Random Graphs
inferred← citeshttps://doi.org/10.1023/a:1020689507456openalex-snapshot
Accessibility and Reliability for Connected Bipartite Graphs
inferred← citeshttps://doi.org/10.1081/sta-200060736openalex-snapshot
Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs
inferred← citeshttps://doi.org/10.1088/1751-8121/ac3a34openalex-snapshot
Analytical results for the distribution of cover times of random walks on random regular graphs
inferred← citeshttps://doi.org/10.1093/biomet/asaf031openalex-snapshot
Exact sampling of spanning trees via fast-forwarded random walks
inferred← citeshttps://doi.org/10.1093/nar/gkp075openalex-snapshot
Integration of phenotypic metadata and protein similarity in Archaea using a spectral bipartitioning approach
inferred← citeshttps://doi.org/10.1103/physreve.109.014121openalex-snapshot
Cover times of many random walkers on a discrete network
inferred← citeshttps://doi.org/10.1103/physreve.84.022103openalex-snapshot
Numerical evidence against a conjecture on the cover time of planar graphs
inferred← citeshttps://doi.org/10.1103/physreve.94.062131openalex-snapshot
Exact distributions of cover times for N independent random walkers in one dimension
inferred← citeshttps://doi.org/10.1109/cimca.2006.147openalex-snapshot
Model-driven Walks for Resource Discovery in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/ewsn.2005.1461994openalex-snapshot
Bounds on the mixing time and partial cover of ad-hoc and sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354487openalex-snapshot
Random walks in peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/istcs.1993.253476openalex-snapshot
Random walks on colored graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63516openalex-snapshot
Generating random spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238178openalex-snapshot
On certain connectivity properties of the Internet topology
inferred← citeshttps://doi.org/10.1109/tcad.2011.2138430openalex-snapshot
Hitting Time Analysis for Fault-Tolerant Communication at Nanoscale in Future Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/tnse.2018.2797483openalex-snapshot
Spectral Properties of Extended Sierpiński Graphs and Their Applications
inferred← citeshttps://doi.org/10.1137/0403039openalex-snapshot
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
inferred← citeshttps://doi.org/10.1137/0405007openalex-snapshot
A Technique for Lower Bounding the Cover Time
inferred← citeshttps://doi.org/10.1137/090745854openalex-snapshot
Search via Quantum Walk
inferred← citeshttps://doi.org/10.1137/15m1010737openalex-snapshot
The Hitting Time of Multiple Random Walks
inferred← citeshttps://doi.org/10.1137/23m1576645openalex-snapshot
Cover Times of Many Diffusive or Subdiffusive Searchers
inferred← citeshttps://doi.org/10.1137/s0895480194264988openalex-snapshot
Short Random Walks on Graphs
inferred← citeshttps://doi.org/10.1140/epjb/e2007-00208-2openalex-snapshot
Growing distributed networks with arbitrary degree distributions
inferred← citeshttps://doi.org/10.1140/epjb/e2020-100563-2openalex-snapshot
Bounding robustness in complex networks under topological changes through majorization techniques
inferred← citeshttps://doi.org/10.1145/100216.100249openalex-snapshot
A technique for lower bounding the cover time
inferred← citeshttps://doi.org/10.1145/1164717.1164757openalex-snapshot
The power of choice in random walks
inferred← citeshttps://doi.org/10.1145/1250790.1250874openalex-snapshot
Search via quantum walk
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1145/1378533.1378557openalex-snapshot
Many random walks are faster than one
inferred← citeshttps://doi.org/10.1145/167088.167275openalex-snapshot
Short random walks on graphs
inferred← citeshttps://doi.org/10.1145/1835698.1835776openalex-snapshot
Expansion and the cover time of parallel random walks
inferred← citeshttps://doi.org/10.1145/1860684.1860689openalex-snapshot
Radio cover time in hyper-graphs
inferred← citeshttps://doi.org/10.1145/1993636.1993646openalex-snapshot
Cover times, blanket times, and majorizing measures
inferred← citeshttps://doi.org/10.1145/3519270.3538435openalex-snapshot
Near-Optimal Leader Election in Population Protocols on Graphs
inferred← citeshttps://doi.org/10.1145/3576900openalex-snapshot
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
inferred← citeshttps://doi.org/10.1145/3583691openalex-snapshot
Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time
inferred← citeshttps://doi.org/10.1145/73007.73062openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.1186/1471-2164-10-145openalex-snapshot
The complete genome sequence of Staphylothermus marinus reveals differences in sulfur metabolism among heterotrophic Crenarchaeota
inferred← citeshttps://doi.org/10.1214/24-aap2128openalex-snapshot
Structural results for the tree builder random walk
inferred← citeshttps://doi.org/10.1214/ejp.v9-198openalex-snapshot
Mixing Times for Random Walks on Finite Lamplighter Groups
inferred← citeshttps://doi.org/10.1287/mnsc.38.10.1432openalex-snapshot
Improving Monte Carlo Efficiency by Increasing Variance
inferred← citeshttps://doi.org/10.1587/transcom.e95.b.995openalex-snapshot
A Topology-Aware Random Walk
inferred← citeshttps://doi.org/10.3233/fi-2012-755openalex-snapshot
Computing Issues of Asynchronous CA
inferred← citeshttps://doi.org/10.4007/annals.2012.175.3.8openalex-snapshot
Cover times, blanket times, and majorizing measures
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.41openalex-snapshot
Graph Clustering using Effective Resistance
inferred← citeshttps://doi.org/10.48550/arxiv.0705.0467openalex-snapshot
Many Random Walks Are Faster Than One
inferred← citeshttps://doi.org/10.48550/arxiv.0907.1678openalex-snapshot
Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4371openalex-snapshot
Cover times, blanket times, and majorizing measures
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3430openalex-snapshot
The Cover Time of Deterministic Random Walks
inferred← citeshttps://doi.org/10.48550/arxiv.1308.1041openalex-snapshot
Traversals of Infinite Graphs with Random Local Orientations
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08843openalex-snapshot
The Meeting Time of Multiple Random Walks
inferred← citeshttps://doi.org/10.48550/arxiv.1903.00606openalex-snapshot
Discovering Options for Exploration by Minimizing Cover Time
inferred← citeshttps://doi.org/10.48550/arxiv.2110.05740openalex-snapshot
Temporal Abstraction in Reinforcement Learning with the Successor Representation
inferred← citeshttps://doi.org/10.5121/jgraphoc.2014.6101openalex-snapshot
Enhanced Random Walk With Choice: An Empirical Study
inferred← citeshttps://doi.org/10.5555/313852.314098openalex-snapshot
RCN algorithms for the uniform generation of combinatorial structures
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.