CoChat

Random Walks on Regular and Irregular Graphs

Coppersmith, Don, Feige, Uriel, Shearer, James · 1996 · SIAM Journal on Discrete Mathematics

The DOI matches its Crossref record; 10 of the 12 references it cites were found in a registry or an index, and 2 are not checked yet.

Abstract

For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy-to-compute graph properties. Namely, for any connected graph, the cyclic cover time is $\Theta (n^2 d_{ave} (d^{ - 1} )_{ave} $), where n is the number of vertices in the graph, $d_{ave} $ is the average degree of its vertices, and $(d^{ - 1} )_{ave} $ is the average of the inverse of the degree of its vertices. Other results obtained in the processes of proving the main theorem are a similar characterization of minimum resistance spanning trees of graphs, improved bounds on the cover time of graphs, and a simplified proof that the maximum commute time in any connected graph is at most $4n^3 /27 + o(n^3 )$.

Overview

Integrity signals

Registry

Crossref · 10.1137/s0895480193260595

Cites

10 of 12 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 12 references

Research works printed but not linked: 2

  1. Feige Uriel, 1993, 34th Annual Symposium on Foundations of Computer Science (Palo Alto, CA, 1993), 238
  2. Garey M., 1979, Computers and intractability

Cited by

See all 52

Metadata

Authors
Coppersmith, D., Feige, U., & Shearer, J.
Venue
SIAM Journal on Discrete Mathematics
Published
1996-05
Volume
9
Issue
2
Pages
301-308
ISSN
  • 0895-4801 (ISSN-L)
  • 1095-7146
OpenAlex
W2091147489
Cited by
49
References
10
Citations by year
2025: 1 · 2024: 3 · 2021: 2 · 2020: 2 · 2018: 5 · 2017: 5 · 2014: 2 · 2013: 1 · 2012: 4
FWCI
1.69
Type
journal article
Language
en
Open access
closed
Locations
SIAM Journal on Discrete Mathematics (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
Keywords
random walks, cover time, simple random walk, commuting time, graph structure, average degree, irregular graphs, connected graphs

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Random Walks on Regular and Irregular Graphs. https://app.cochat.ai/papers/10.1137/s0895480193260595
The paper
Coppersmith, D., Feige, U., & Shearer, J. (1996). Random Walks on Regular and Irregular Graphs. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/s0895480193260595

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.