Elephant Random Walks on Coverings of Dipole Graphs

Abstract

In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic lattices arising as coverings of dipole graphs. We focus on lattices whose admissible step directions in the two parts of the bipartition are negatives of each other and disjoint. On such graphs, we define an ERW in which each step is chosen by referring to the entire history of the walk. The ERW on the hexagonal lattice is a prototypical example of our model. The definition and asymptotic analysis of such ERWs are not straightforward because both depend strongly on the underlying geometric structure. Our analysis is based on a combination of the Pólya-type urn techniques and the martingale approach, two standard methods for analyzing ERWs. We find that the counting process of the ERW forms a Pólya-type urn with two-periodic generating matrices. By analyzing for such urn models, we show the strong law of large numbers for the counting process. Combining the result for the counting process with the martingale approach, we derive non-standard strong laws of large numbers and central limit theorems for the position process of the ERW in the diffusive and critical regimes, as well as almost sure and $L^2$ scaling limits in the superdiffusive regime.