Pith. sign in

REVIEW 2 cited by

Almost sure and moment convergence for triangular P\'olya urns

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 2402.01299 v2 pith:GQRQNKSV submitted 2024-02-02 math.PR

classification math.PR
keywords urnsconditionscorrespondingconvergenceformgenerallimitmoment
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider triangular P\'olya urns and show under very weak conditions a general strong limit theorem of the form $X_{ni}/a_{ni}\to \mathcal{X}_i$ a.s., where $X_{ni}$ is the number of balls of colour $i$ after $n$ draws; the constants $a_{ni}$ are explicit and of the form $n^\alpha\log^\gamma n$; the limit is a.s. positive, and may be either deterministic or random, but is in general unknown. The result extends to urns with subtractions under weak conditions, but a counterexample shows that some conditions are needed. For balanced urns we also prove moment convergence in the main results if the replacements have the corresponding moments. The proofs are based on studying the corresponding continuous-time urn using martingale methods, and showing corresponding results there. We assume for convenience that all replacements have finite second moments.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Moments of balanced P\'olya urns

    math.PR 2025-05 accept novelty 5.0 of 10

    For balanced Polya urns, the p-th moments of centered ball counts obey explicit polynomial-in-n bounds matching the urn's dominant eigenvalues, yielding moment convergence whenever a central limit theorem is known.

  2. Think, Prune, Train, Improve: Scaling Reasoning without Scaling Models

    cs.LG 2025-04 reject novelty 4.0 of 10

    Recursively fine-tuning language models on their own ground-truth-pruned reasoning traces improves GSM8K Pass@1, but the claimed GPT-4o-beating result rests on a nonstandard 500-question test subset.

Pith tools