Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-07T01:44:43.351Z Has data issue: false hasContentIssue false

Scaling limits of discrete-time Markov chains and their local times on electrical networks

Published online by Cambridge University Press:  17 September 2026

Ryoichiro Noda*
Affiliation:
Waseda University
*
*Postal address: Faculty of Science and Engineering, Waseda University, 3-4-1, Okubo, Shinjuku-ku, Tokyo, 169-8555, Japan. Email: r_noda@aoni.waseda.jp
Rights & Permissions [Opens in a new window]

Abstract

We establish that if a sequence of electrical networks equipped with conductance measures converges in the local Gromov–Hausdorff-vague topology and satisfies certain non-explosion and metric-entropy conditions, then the sequence of associated discrete-time Markov chains and their local times also converges. This result applies to many examples, such as critical Galton–Watson trees conditioned on size, uniform spanning trees, random recursive fractals, the critical Erdős–Rényi random graph, the configuration model, and the random conductance model on fractals. To obtain the convergence result, we characterize and study extended Dirichlet spaces associated with resistance forms, and we study traces of electrical networks.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NCCreative Common License - ND
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives licence (https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided that no alterations are made and the original article is properly cited. The written permission of Cambridge University Press or the rights holder(s) must be obtained prior to any commercial use and/or adaptation of the article.
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure A.1. Figure A.1 long description.From left to right, the unbounded Sierpiński gasket graphs G0$G_{0}$ and G1$G_{1}$ and the associated map gm$g_{m}$.