Pith. sign in

REVIEW

How often can two independent elephant random walks on $\mathbb{Z}$ meet?

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 2404.13490 v1 pith:EBHULVUL submitted 2024-04-21 math.PR

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

Signed reviews

No signed human review yet.

0 comments
abstract

We show that two independent elephant random walks on the integer lattice $\mathbb{Z}$ meet each other finitely often or infinitely often depends on whether the memory parameter $p$ is strictly larger than $3/4$ or not. Asymptotic results for the distance between them are also obtained.

Discussion (0). Continue with ORCID to comment.

Pith tools