Saved in:
Bibliographic Details
Main Authors: Naganuma, Nobuaki, Yura, Kaito
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.26059
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908916769619968
author Naganuma, Nobuaki
Yura, Kaito
author_facet Naganuma, Nobuaki
Yura, Kaito
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2603_26059
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Elephant Random Walks on Coverings of Dipole Graphs
Naganuma, Nobuaki
Yura, Kaito
Probability
Primary: 05C81, Secondary: 60F05, 60F15
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.
title Elephant Random Walks on Coverings of Dipole Graphs
topic Probability
Primary: 05C81, Secondary: 60F05, 60F15
url https://arxiv.org/abs/2603.26059