Iterated Graph Systems (I): random walks and diffusion limits
Abstract
This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the Gromov--Hausdorff--Prokhorov--Skorokhod topology to the limiting diffusion, which coincides with Brownian motion when the resistance dimension is positive. The graph analysis underlying this convergence identifies the degree dimension as the natural correction term for on-diagonal heat-kernel estimates, yielding a unified formulation in the locally finite and locally infinite (scale-free) regimes. Using this framework, we solve the open problem on the DHL percolation cluster posed by Hambly and Kumagai [Commun. Math. Phys. 295 (2010), 29--69].
Cite
@article{arxiv.2603.13798,
title = {Iterated Graph Systems (I): random walks and diffusion limits},
author = {Ziyu Neroli},
journal= {arXiv preprint arXiv:2603.13798},
year = {2026}
}
Comments
47 pages, 12 figures