REVIEW 1 cited by
Pemantle's min-plus binary tree
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
Pemantle's min-plus binary tree
read the original abstract
We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives. Particles start at the bottom of a binary tree of depth N and move towards the root. Assuming that merging or annihilation happens independently at random, we determine the limit law of the final mass of the system in the large N limit.
Forward citations
Cited by 1 Pith paper
-
Hipster random walks, random series-parallel graph and random homogeneous systems
Random homogeneous systems converge weakly to the density (3/4)(1-x²) on (-1,1), affirming conjectures on series-parallel graph resistance and hipster walks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.