Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 181

The DOI matches its Crossref record.

Chernoff's theorem in the branching random walk

Biggins, J. D.·1977·Journal of Applied Probability

Abstract

If F n∗ is the n-fold Stieltjes convolution of the increasing function F, then a version of Chernoff's theorem, on the limiting behaviour of (F n∗ (na))1/n , is established for F n∗ . If Z (n)(t) is the number of the n th-generation people to the left of t in a supercritical branching random walk then an analogous result is proved for Z (n).

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1017/s0021900200025900

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

See all 181

Metadata

Authors
Biggins, J. D.
Venue
Journal of Applied Probability
Published
1977-09
Volume
14
Issue
03
Pages
630-636
ISSN
  • 0021-9002 (ISSN-L)
  • 1475-6072
OpenAlex
W2086534817
Cited by
181
References
0
FWCI
0.98
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

How to cite

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

This page
CoChat. (2026). Citation check: Chernoff's theorem in the branching random walk. https://app.cochat.ai/papers/10.1017/s0021900200025900
The paper
Biggins, J. D. (1977). Chernoff's theorem in the branching random walk. Journal of Applied Probability. https://doi.org/10.1017/s0021900200025900

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.