Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.08662 v1 pith:OF32YA7V submitted 2022-11-16 math.PR

Many-to-few for non-local branching Markov process

classification math.PR
keywords branchingdifferentformulanon-localpopulationsettingtimesgeneral
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We provide a many-to-few formula in the general setting of non-local branching Markov processes. This formula allows one to compute expectations of k-fold sums over functions of the population at k different times. The result generalises [14] to the non-local setting, as introduced in [11] and [8]. As an application, we consider the case when the branching process is critical, and conditioned to survive for a large time. In this setting, we prove a general formula for the limiting law of the death time of the most recent common ancestor of two particles selected uniformly from the population at two different times, as t tends to infinity. Moreover, we describe the limiting law of the population sizes at two different times, in the same asymptotic regime.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.