Covering Problems for Brownian Motion on Spheres
Open accessThe DOI matches its Crossref record.
Abstract
Bounds are given on the mean time taken by a strong Markov process to visit all of a finite collection of subsets of its state space. These bounds are specialized to Brownian motion on the surface of the unit sphere $\Sigma_p$ in $R^p$. This leads to bounds on the mean time taken by this Brownian motion to come within a distance $\varepsilon$ of every point on the sphere and bounds on the mean time taken to come within $\varepsilon$ of every point or its opposite. The second case is related to the Grand Tour, a technique of multivariate data analysis that involves a search of low-dimensional projections. In both cases the bounds are asymptotically tight as $\varepsilon \rightarrow 0$ on $\Sigma_p$ for $p \geq 4$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., & Smolensky, R. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73062 · Cited by 360
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R., & Tiwari, P. (1996) · Computational Complexity · doi:10.1007/bf01270385 · Cited by 328
Random Walks on Regular and Irregular Graphs
Coppersmith, D., Feige, U., & Shearer, J. (1996) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480193260595 · Cited by 49
“Better bounds on the cover time can sometimes be obtained from the relation EC[G] maxu;v [H [u; v]] lnn [15].”
Background
Metadata
- Authors
- Matthews, P.
- Venue
- The Annals of Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 1988-01-01
- Volume
- 16
- Issue
- 1
- ISSN
- 0091-1798 (ISSN-L)
- OpenAlex
- W1986507557
- Cited by
- 111
- References
- 0
- FWCI
- 3.54
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Covering Problems for Brownian Motion on Spheres. https://app.cochat.ai/papers/10.1214/aop/1176991894
- The paper
- Matthews, P. (1988). Covering Problems for Brownian Motion on Spheres. The Annals of Probability. https://doi.org/10.1214/aop/1176991894
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.