The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Strong Stationary Times Via a New Form of Duality
Open accessAbstract
A strong stationary time for a Markov chain $(X_n)$ is a stopping time $T$ for which $X_T$ is stationary and independent of $T$. Such times yield sharp bounds on certain measures of nonstationarity for $X$ at fixed finite times $n$. We construct an absorbing dual Markov chain with absorption time a strong stationary time for $X$. We relate our dual to a notion of duality used in the study of interacting particle systems. For birth and death chains, our dual is again birth and death and permits a stochastic interpretation of the eigenvalues of the transition matrix for $X$. The duality approach unifies and extends the analysis of previous constructions and provides several new examples.
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
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Doob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
(2016) · Foundations of Physically Based Modeling and Animation · doi:10.1201/9781315373140-16 · Cited by 3,267
A second course in stochastic processes
Karlin, S., & Taylor, H. E. (1981) · Cited by 2,770
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Self-citationProcessus stochastiques et mouvement brownien
Lévy, P. (1948) · Gauthier-Villars eBooks · Cited by 958
The theory of queues with a single server
Lindley, D. V. (1952) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100027638 · Cited by 875
Markov Chain Models — Rarity and Exponentiality
(1979) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-6200-8 · Cited by 826
General Irreducible Markov Chains and Non-Negative Operators.
Rao, M. B., & Nummelin, E. (1985) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981963 · Cited by 599
Random Walk and the Theory of Brownian Motion
Kac, M. (1947) · The American Mathematical Monthly · doi:10.1080/00029890.1947.11990189 · Cited by 563
Shuffling Cards and Stopping Times
Aldous, D., & Diaconis, P. (1986) · The American Mathematical Monthly · doi:10.1080/00029890.1986.11971821 · Cited by 475
Self-citationA new approach to the limit theory of recurrent Markov chains
Athreya, K. B., & Ney, P. (1978) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1978-0511425-0 · Cited by 412
Strong uniform times and finite random walks
Aldous, D., & Diaconis, P. (1987) · Advances in Applied Mathematics · doi:10.1016/0196-8858(87)90006-6 · Cited by 233
Self-citationStochastically monotone Markov Chains
Daley, D. J. (1968) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf00531852 · Cited by 185
Asymptotic analysis of a random walk on a hypercube with many dimensions
Diaconis, P., Graham, R. L., & Morrison, J. A. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010105 · Cited by 161
Self-citationTime to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
Diaconis, P., & Shahshahani, M. (1987) · SIAM Journal on Mathematical Analysis · doi:10.1137/0518016 · Cited by 160
Self-citationDubins, L. E. (1968) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177698036 · Cited by 141
Isotropic random walks in a tree
Sawyer, S. A. (1978) · Probability Theory and Related Fields · doi:10.1007/bf00533464 · Cited by 95
Mixing Rates for a Random Walk on the Cube
Matthews, P. (1987) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0608060 · Cited by 26
Time to Stationarity for a Continuous-Time Markov Chain
Fill, J. A. (1991) · Probability in the Engineering and Informational Sciences · doi:10.1017/s0269964800001893 · Cited by 26
Self-citationExamples for the Theory of Strong Stationary Duality with Countable State Spaces
Diaconis, P. W., & Fill, J. A. (1990) · Probability in the Engineering and Informational Sciences · doi:10.1017/s0269964800001522 · Cited by 15
Self-citation
Cited by
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Odentrantz, J. (2000) · Technometrics · doi:10.1080/00401706.2000.10485734 · Cited by 973
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Self-citationLectures on finite Markov chains
Saloff-Coste, L. (1997) · Lecture Notes in Mathematics · doi:10.1007/bfb0092621 · Cited by 382
Fill, J. A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005981 · Cited by 320
Self-citationAnalysis of a nonreversible Markov chain sampler
Diaconis, P., Holmes, S., & Neal, R. M. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487508 · Cited by 284
Self-citation
Metadata
- Authors
- Diaconis, P., & Fill, J. A.
- Venue
- The Annals of Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 1990-10-01
- Volume
- 18
- Issue
- 4
- ISSN
- 0091-1798 (ISSN-L)
- OpenAlex
- W1991556567
- Cited by
- 253
- References
- 21
- FWCI
- 5.24
- 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
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.