The DOI matches its Crossref record.
An Introduction to Probability Theory and Its Applications, Vol. 2
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
The random walk's guide to anomalous diffusion: a fractional dynamics approach
Metzler, R., & Klafter, J. (2000) · Physics Reports · doi:10.1016/s0370-1573(00)00070-3 · Cited by 9,026
On the generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Monte Carlo and quasi-Monte Carlo methods
Caflisch, R. E. (1998) · Acta Numerica · doi:10.1017/s0962492900002804 · Cited by 1,754
On the histogram as a density estimator:L 2 theory
Freedman, D., & Diaconis, P. (1981) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf01025868 · Cited by 1,601
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk
Madras, N., & Sokal, A. D. (1988) · Journal of Statistical Physics · doi:10.1007/bf01022990 · Cited by 939
Selecting the Best-Fit Model of Nucleotide Substitution
Posada, D., & Crandall, K. A. (2001) · Systematic Biology · doi:10.1080/10635150118469 · Cited by 937
Probability: Theory and Examples
Durrett, R. (2019) · doi:10.1017/9781108591034 · Cited by 857
Grigor’yan, A. (1999) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-99-00776-4 · Cited by 807
The Fourier-series method for inverting transforms of probability distributions
Abate, J., & Whitt, W. (1992) · Queueing Systems · doi:10.1007/bf01158520 · Cited by 697
Gilbert, E. N. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109045 · Cited by 656
Bayesian Phylogenetic Model Selection Using Reversible Jump Markov Chain Monte Carlo
Huelsenbeck, J. P. (2004) · Molecular Biology and Evolution · doi:10.1093/molbev/msh123 · Cited by 591
Correlated and uncorrelated fitness landscapes and how to tell the difference
Weinberger, E. (1990) · Biological Cybernetics · doi:10.1007/bf00202749 · Cited by 561
Small-Bias Probability Spaces: Efficient Constructions and Applications
Naor, J., & Naor, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222053 · Cited by 560
Polynomial-Time Approximation Algorithms for the Ising Model
Jerrum, M., & Sinclair, A. (1993) · SIAM Journal on Computing · doi:10.1137/0222066 · Cited by 548
Sampling-through-time in birth–death trees
Stadler, T. (2010) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2010.09.010 · Cited by 539
Products of indecomposable, aperiodic, stochastic matrices
Wolfowitz, J. (1963) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1963-0154756-3 · Cited by 522
An evolutionary model for maximum likelihood alignment of DNA sequences
Thorne, J. L., Kishino, H., & Felsenstein, J. (1991) · Journal of Molecular Evolution · doi:10.1007/bf02193625 · Cited by 444
Selection and sorting with limited storage
Munro, J. I., & Paterson, M. S. (1980) · Theoretical Computer Science · doi:10.1016/0304-3975(80)90061-4 · Cited by 414
Mapping Mutations on Phylogenies
Nielsen, R. (2002) · Systematic Biology · doi:10.1080/10635150290102393 · Cited by 412
Pittel, B. (1987) · SIAM Journal on Applied Mathematics · doi:10.1137/0147013 · Cited by 386
Bennett, C. H., & Gill, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210008 · Cited by 381
The general coalescent with asynchronous mergers of ancestral lines
Sagitov, S. (1999) · Journal of Applied Probability · doi:10.1239/jap/1032374759 · Cited by 350
Reducing location update cost in a PCS network
Lin, Y.-B. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.554719 · Cited by 330
On the theory of queues with many servers
Kiefer, J., & Wolfowitz, J. (1955) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1955-0066587-3 · Cited by 312
Comparing Bootstrap and Posterior Probability Values in the Four-Taxon Case
Cummings, M. P., Handley, S. A., Myers, D. S., Reed, D. L., Rokas, A., & Winka, K. (2003) · Systematic Biology · doi:10.1080/10635150309311 · Cited by 305
Minimal Penalties for Gaussian Model Selection
Birgé, L., & Massart, P. (2007) · Probability Theory and Related Fields · doi:10.1007/s00440-006-0011-8 · Cited by 299
Babai, L., Erdo˝s, P., & Selkow, S. M. (1980) · SIAM Journal on Computing · doi:10.1137/0209047 · Cited by 293
Models of Molecular Evolution and Phylogeny: Table 1.
Liò, P., & Goldman, N. (1998) · Genome Research · doi:10.1101/gr.8.12.1233 · Cited by 284
Inferring the root of a phylogenetic tree.
Huelsenbeck, J. P., Bollback, J. P., & Levine, A. M. (2002) · Systematic Biology · doi:10.1080/106351502753475862 · Cited by 221
Quality and the efficiency of data in “Smart-Cities”
Sta, H. B. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2016.12.021 · Cited by 108
Metadata
- Authors
- Feller, W., & Teichmann, T.
- Venue
- Physics Today
- Publisher
- AIP Publishing
- Published
- 1967-05-01
- Volume
- 20
- Issue
- 5
- Pages
- 76-76
- ISSN
- 0031-9228 (ISSN-L)
- 1945-0699
- OpenAlex
- W193706516
- Cited by
- 1,280
- References
- 0
- FWCI
- 26.69
- Type
- journal article
- Language
- en
- Open access
- closed
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.