How two elephants can learn from each other

DOI10.1016/J.SPA.2026.105040MaRDI QIDQ7324689zbMATH OpenFDO

Authors Rafik Aguech, Shuo Qin

Publication date 4 September 2026

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.SPA.2026.105040

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Martingales with discrete parameter (60G42) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• A law of the iterated logarithm for double arrays of independent random variables with applications to regression and time series models
• A martingale approach for the elephant random walk
• A strong invariance principle for the elephant random walk
• Central limit theorem and related results for the elephant random walk
• Gaussian fluctuation for superdiffusive elephant random walks
• How often can two independent elephant random walks on \(\mathbb{Z}\) meet?
• scientific article; zbMATH DE number 3723610 (Why is no real title available?)
• scientific article; zbMATH DE number 976356 (Why is no real title available?)
• scientific article; zbMATH DE number 884971 (Why is no real title available?)
• scientific article; zbMATH DE number 1405930 (Why is no real title available?)
• scientific article; zbMATH DE number 3333814 (Why is no real title available?)
• Title not available (Why is no real title available?)
• Interacting edge-reinforced random walks
• Maximal inequalities and the law of the iterated logarithm
• On the limit law of the superdiffusive elephant random walk
• Recurrence and transience of multidimensional elephant random walks
• Recurrence-transience phase transition of the step-reinforced random walk at 1/2
• Stochastic approximation and its applications
• Stochastic processes with competing reinforcements
• Synchronization of reinforced stochastic processes with a network-based interaction
• The shark random swim. (Lévy flight with memory)
• Two particles' repelling random walks on the complete graph
• Two repelling random walks on \(\mathbb{Z}\)
• Universality of noise reinforced Brownian motions
• Vertex reinforced random walks with exponential interaction on complete graphs

This page was built for publication: How two elephants can learn from each other

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7324689)