On the public citation graph

Lower bounds for covering times for reversible Markov chains and random walks on graphs

https://doi.org/10.1007/bf01048272
0 signed · 78 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.1016/c2009-1-28569-8openalex-snapshot
A First Course in Stochastic Processes

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/9781118650684.ch02openalex-snapshot
Multiway cuts and spectra
inferred← citeshttps://doi.org/10.1002/cpe.4973openalex-snapshot
Performance analysis of Israeli‐Jalfon's algorithm using probabilistic model checking
inferred← citeshttps://doi.org/10.1002/net.20461openalex-snapshot
A model of self‐avoiding random walks for searching complex networks
inferred← citeshttps://doi.org/10.1002/rsa.20504openalex-snapshot
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
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.3240060406openalex-snapshot
A tight lower bound on the cover time 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/3-540-45465-9_76openalex-snapshot
Fast Universalization of Investment Strategies with Provably Good Relative Returns
inferred← citeshttps://doi.org/10.1007/978-0-8176-4904-3_13openalex-snapshot
Fair and Biased Random Walks on Undirected Graphs and Related Entropies
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-3635-8_20openalex-snapshot
Asymptotic Joint Distribution of Cover Times
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
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-642-00672-2_29openalex-snapshot
A Term-Based Driven Clustering Approach for Name Disambiguation
inferred← citeshttps://doi.org/10.1007/978-3-642-36669-7_29openalex-snapshot
Exploring Unknown Paths in Networks Based on Multiple Random Walks
inferred← citeshttps://doi.org/10.1007/bf01046092openalex-snapshot
Random walks on highly symmetric graphs
inferred← citeshttps://doi.org/10.1007/bf01048273openalex-snapshot
Bounds on the cover time
inferred← citeshttps://doi.org/10.1007/bf02213458openalex-snapshot
Covering with blocks in the non-symmetric case
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/0022-247x(91)90149-topenalex-snapshot
Random walk covering of some special trees
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.2007.09.012openalex-snapshot
The power of choice in random walks: An empirical study
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.10.006openalex-snapshot
Performance of random walks in one-hop replication networks
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.02.008openalex-snapshot
Random walks on graphs with interval weights and precise marginals
inferred← citeshttps://doi.org/10.1016/j.jmaa.2019.123488openalex-snapshot
On the fastest finite Markov processes
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.05.008openalex-snapshot
MIRACLE: A multiple independent random walks community parallel detection algorithm for big graphs
inferred← citeshttps://doi.org/10.1016/j.neucom.2022.10.004openalex-snapshot
Refined probability distribution module for fine-grained visual categorization
inferred← citeshttps://doi.org/10.1016/j.socnet.2018.08.008openalex-snapshot
Fast clustering for signed graphs based on random walk gap
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.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/s0963548322000372openalex-snapshot
Multiple random walks on graphs: mixing few to cover many
inferred← citeshttps://doi.org/10.1038/s41587-022-01341-yopenalex-snapshot
Variant to function mapping at single-cell resolution through network propagation
inferred← citeshttps://doi.org/10.1080/00029890.1989.11972266openalex-snapshot
The Editor's Corner: The White Screen Problem
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/comjnl/bxab070openalex-snapshot
Modeling Higher-Order Interactions in Complex Networks by Edge Product of Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxx094openalex-snapshot
Extended Corona Product as an Exactly Tractable Model for Weighted Heterogeneous Networks
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.1109/cse-euc.2017.116openalex-snapshot
Random Walk on Undirected Networks Based on the Neighbor Nodes Degree Distribution
inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488877openalex-snapshot
P-FedAvg: Parallelizing Federated Learning with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/jsac.2010.100505openalex-snapshot
Phero-trail: a bio-inspired location service for mobile underwater sensor networks
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21964openalex-snapshot
Bounds on the cover time
inferred← citeshttps://doi.org/10.1109/tmi.2021.3073986openalex-snapshot
GraphRegNet: Deep Graph Regularisation Networks on Sparse Keypoints for Dense Registration of 3D Lung CTs
inferred← citeshttps://doi.org/10.1109/tnet.2022.3168939openalex-snapshot
Accelerating Federated Learning via Parallel Servers: A Theoretically Guaranteed Approach
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.1109/tpami.2019.2954313openalex-snapshot
Person Re-Identification With Deep Kronecker-Product Matching and Group-Shuffling Random Walk
inferred← citeshttps://doi.org/10.1128/msystems.00989-25openalex-snapshot
MNetClass: a control-free microbial network clustering framework for identifying central subcommunities across ecological niches
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/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.1139/cjp-2017-0274openalex-snapshot
Eigenvalues of transition weight matrix and eigentime identity of weighted network with two hub nodes
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/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/1860684.1860689openalex-snapshot
Radio cover time in hyper-graphs
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.1214/07-aap451openalex-snapshot
One-dimensional stepping stone models, sardine genetics and Brownian local time
inferred← citeshttps://doi.org/10.1214/105051606000000619openalex-snapshot
Waiting for regulatory sequences to appear
inferred← citeshttps://doi.org/10.1214/24-aop1699openalex-snapshot
Linear cover time is exponentially unlikely
inferred← citeshttps://doi.org/10.1214/aos/1176348114openalex-snapshot
Geometrizing Rates of Convergence, II
inferred← citeshttps://doi.org/10.1214/ecp.v10-1167openalex-snapshot
Random Walk Attracted by Percolation Clusters
inferred← citeshttps://doi.org/10.1214/ejp.v16-869openalex-snapshot
Explicit Expanders with Cutoff Phenomena
inferred← citeshttps://doi.org/10.1214/ejp.v20-4077openalex-snapshot
Computing cutoff times of birth and death chains
inferred← citeshttps://doi.org/10.1214/lnms/1215459284openalex-snapshot
Applications of Random Walks on Finite Graphs
inferred← citeshttps://doi.org/10.12737/21451openalex-snapshot
Resource network theory
inferred← citeshttps://doi.org/10.1287/mnsc.38.10.1432openalex-snapshot
Improving Monte Carlo Efficiency by Increasing Variance
inferred← citeshttps://doi.org/10.13001/1081-3810.3344openalex-snapshot
Stochastic forms of non-negative matrices and Perron-regularity
inferred← citeshttps://doi.org/10.14288/1.0051610openalex-snapshot
Growth processes on formulas and reversible circuits
inferred← citeshttps://doi.org/10.3390/e24070918openalex-snapshot
A Locust-Inspired Model of Collective Marching on Rings
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.1308.1041openalex-snapshot
Traversals of Infinite Graphs with Random Local Orientations
inferred← citeshttps://doi.org/10.5121/jgraphoc.2014.6101openalex-snapshot
Enhanced Random Walk With Choice: An Empirical Study
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.